| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: The reciprocal of a positive real exists. Part of Proposition 9-3.7(v) of [Gleason] p. 124. |
| Ref | Expression |
|---|---|
| recexpr | ⊢ (A ∈ P → ∃x(x ∈ P ∧ (A ·P x) = 1P)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opreq2 3007 | . . . . 5 ⊢ (x = {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)} → (A ·P x) = (A ·P {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)})) | |
| 2 | 1 | cleq1d 1109 | . . . 4 ⊢ (x = {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)} → ((A ·P x) = 1P ↔ (A ·P {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)}) = 1P)) |
| 3 | 2 | cla4egv 1397 | . . 3 ⊢ ({z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)} ∈ P → ((A ·P {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)}) = 1P → ∃x(A ·P x) = 1P)) |
| 4 | breq1 2065 | . . . . . . 7 ⊢ (z = w → (z <Q y ↔ w <Q y)) | |
| 5 | 4 | anbi1d 469 | . . . . . 6 ⊢ (z = w → ((z <Q y ∧ ¬ (*Q ‘y) ∈ A) ↔ (w <Q y ∧ ¬ (*Q ‘y) ∈ A))) |
| 6 | 5 | biexdv 936 | . . . . 5 ⊢ (z = w → (∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A) ↔ ∃y(w <Q y ∧ ¬ (*Q ‘y) ∈ A))) |
| 7 | 6 | cbvabv 1424 | . . . 4 ⊢ {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)} = {w∣∃y(w <Q y ∧ ¬ (*Q ‘y) ∈ A)} |
| 8 | 7 | reclem2pr 3951 | . . 3 ⊢ (A ∈ P → {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)} ∈ P) |
| 9 | 7 | reclem4pr 3953 | . . 3 ⊢ (A ∈ P → (A ·P {z∣∃y(z <Q y ∧ ¬ (*Q ‘y) ∈ A)}) = 1P) |
| 10 | 3, 8, 9 | sylc 62 | . 2 ⊢ (A ∈ P → ∃x(A ·P x) = 1P) |
| 11 | 1pr 3911 | . . . . . . 7 ⊢ 1P ∈ P | |
| 12 | eleq1 1149 | . . . . . . 7 ⊢ ((A ·P x) = 1P → ((A ·P x) ∈ P ↔ 1P ∈ P)) | |
| 13 | 11, 12 | mpbiri 169 | . . . . . 6 ⊢ ((A ·P x) = 1P → (A ·P x) ∈ P) |
| 14 | visset 1350 | . . . . . . 7 ⊢ x ∈ V | |
| 15 | dmmp 3910 | . . . . . . 7 ⊢ dom ·P = (P × P) | |
| 16 | 0npr 3890 | . . . . . . 7 ⊢ ¬ ∅ ∈ P | |
| 17 | 14, 15, 16 | ndmoprrcl 3060 | . . . . . 6 ⊢ ((A ·P x) ∈ P → (A ∈ P ∧ x ∈ P)) |
| 18 | 13, 17 | syl 12 | . . . . 5 ⊢ ((A ·P x) = 1P → (A ∈ P ∧ x ∈ P)) |
| 19 | 18 | pm3.27d 262 | . . . 4 ⊢ ((A ·P x) = 1P → x ∈ P) |
| 20 | 19 | ancri 245 | . . 3 ⊢ ((A ·P x) = 1P → (x ∈ P ∧ (A ·P x) = 1P)) |
| 21 | 20 | 19.22i 723 | . 2 ⊢ (∃x(A ·P x) = 1P → ∃x(x ∈ P ∧ (A ·P x) = 1P)) |
| 22 | 10, 21 | syl 12 | 1 ⊢ (A ∈ P → ∃x(x ∈ P ∧ (A ·P x) = 1P)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 → wi 2 ∧ wa 196 ∃wex 678 = weq 797 {cab 1090 = wceq 1091 ∈ wcel 1092 class class class wbr 2054 ‘cfv 2422 (class class class)co 3001 *Qcrq 3777 <Q cltq 3778 Pcnp 3779 1Pc1p 3780 ·P cmp 3782 |
| This theorem is referenced by: recexsrlem 4006 |
| 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-mp 3883 |