| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: The reciprocal of a nonzero signed real exists. Part of Proposition 9-4.3 of [Gleason] p. 126. |
| Ref | Expression |
|---|---|
| recexsr.1 | ⊢ A ∈ V |
| Ref | Expression |
|---|---|
| recexsr | ⊢ (A ∈ R → (¬ A = 0R → ∃x(x ∈ R ∧ (A ·R x) = 1R))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recexsr.1 | . . 3 ⊢ A ∈ V | |
| 2 | 1 | sqgt0sr 4009 | . 2 ⊢ (A ∈ R → (¬ A = 0R → 0R <R (A ·R A))) |
| 3 | oprex 3018 | . . . . . . . . 9 ⊢ (A ·R y) ∈ V | |
| 4 | eleq1 1149 | . . . . . . . . . 10 ⊢ (x = (A ·R y) → (x ∈ R ↔ (A ·R y) ∈ R)) | |
| 5 | opreq2 3007 | . . . . . . . . . . 11 ⊢ (x = (A ·R y) → (A ·R x) = (A ·R (A ·R y))) | |
| 6 | 5 | cleq1d 1109 | . . . . . . . . . 10 ⊢ (x = (A ·R y) → ((A ·R x) = 1R ↔ (A ·R (A ·R y)) = 1R)) |
| 7 | 4, 6 | anbi12d 476 | . . . . . . . . 9 ⊢ (x = (A ·R y) → ((x ∈ R ∧ (A ·R x) = 1R) ↔ ((A ·R y) ∈ R ∧ (A ·R (A ·R y)) = 1R))) |
| 8 | 3, 7 | cla4ev 1401 | . . . . . . . 8 ⊢ (((A ·R y) ∈ R ∧ (A ·R (A ·R y)) = 1R) → ∃x(x ∈ R ∧ (A ·R x) = 1R)) |
| 9 | visset 1350 | . . . . . . . . . 10 ⊢ y ∈ V | |
| 10 | 1, 9 | mulasssr 3993 | . . . . . . . . 9 ⊢ ((A ·R A) ·R y) = (A ·R (A ·R y)) |
| 11 | 10 | cleq1i 1108 | . . . . . . . 8 ⊢ (((A ·R A) ·R y) = 1R ↔ (A ·R (A ·R y)) = 1R) |
| 12 | 8, 11 | sylan2b 347 | . . . . . . 7 ⊢ (((A ·R y) ∈ R ∧ ((A ·R A) ·R y) = 1R) → ∃x(x ∈ R ∧ (A ·R x) = 1R)) |
| 13 | mulclsr 3987 | . . . . . . 7 ⊢ ((A ∈ R ∧ y ∈ R) → (A ·R y) ∈ R) | |
| 14 | 12, 13 | sylan 343 | . . . . . 6 ⊢ (((A ∈ R ∧ y ∈ R) ∧ ((A ·R A) ·R y) = 1R) → ∃x(x ∈ R ∧ (A ·R x) = 1R)) |
| 15 | 14 | exp31 293 | . . . . 5 ⊢ (A ∈ R → (y ∈ R → (((A ·R A) ·R y) = 1R → ∃x(x ∈ R ∧ (A ·R x) = 1R)))) |
| 16 | 15 | imp3a 279 | . . . 4 ⊢ (A ∈ R → ((y ∈ R ∧ ((A ·R A) ·R y) = 1R) → ∃x(x ∈ R ∧ (A ·R x) = 1R))) |
| 17 | 16 | 19.23adv 954 | . . 3 ⊢ (A ∈ R → (∃y(y ∈ R ∧ ((A ·R A) ·R y) = 1R) → ∃x(x ∈ R ∧ (A ·R x) = 1R))) |
| 18 | oprex 3018 | . . . 4 ⊢ (A ·R A) ∈ V | |
| 19 | 18 | recexsrlem 4006 | . . 3 ⊢ (0R <R (A ·R A) → ∃y(y ∈ R ∧ ((A ·R A) ·R y) = 1R)) |
| 20 | 17, 19 | syl5 22 | . 2 ⊢ (A ∈ R → (0R <R (A ·R A) → ∃x(x ∈ R ∧ (A ·R x) = 1R))) |
| 21 | 2, 20 | syld 27 | 1 ⊢ (A ∈ R → (¬ A = 0R → ∃x(x ∈ R ∧ (A ·R x) = 1R))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 → wi 2 ∧ wa 196 ∃wex 678 = wceq 1091 ∈ wcel 1092 Vcvv 1348 class class class wbr 2054 (class class class)co 3001 Rcnr 3787 0Rc0r 3788 1Rc1r 3789 ·R cmr 3792 <R cltr 3793 |
| This theorem is referenced by: axrrecex 4081 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 ax-inf 1079 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ne 1192 df-ral 1205 df-rex 1206 df-reu 1207 df-rab 1208 df-v 1349 df-sbc 1441 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-pss 1494 df-nul 1708 df-if 1777 df-pw 1799 df-sn 1811 df-pr 1812 df-tp 1814 df-op 1815 df-uni 1920 df-int 1966 df-iun 1996 df-tr 2042 df-br 2063 df-opab 2098 df-eprel 2122 df-id 2125 df-po 2128 df-so 2138 df-fr 2169 df-we 2186 df-ord 2202 df-on 2203 df-lim 2204 df-suc 2205 df-om 2373 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fv 2438 df-rdg 2970 df-opr 3003 df-oprab 3004 df-1o 3104 df-oadd 3106 df-omul 3107 df-er 3200 df-ec 3202 df-qs 3205 df-ni 3794 df-pli 3795 df-mi 3796 df-lti 3797 df-plpq 3829 df-mpq 3830 df-enq 3831 df-nq 3832 df-plq 3833 df-mq 3834 df-rq 3835 df-ltq 3836 df-1q 3837 df-np 3880 df-1p 3881 df-plp 3882 df-mp 3883 df-ltp 3884 df-plpr 3958 df-mpr 3959 df-enr 3960 df-nr 3961 df-plr 3962 df-mr 3963 df-ltr 3964 df-0r 3965 df-1r 3966 df-m1r 3967 |