| 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 3975 | . . . . 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 | eqeq1d 1486 | . . . 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 1866 | . . 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 2627 | . . . . . . 7 ⊢ (z = w → (z <Q y ↔ w <Q y)) | |
| 5 | 4 | anbi1d 619 | . . . . . 6 ⊢ (z = w → ((z <Q y ⋀ ¬ (*Q ‘y) ∈ A) ↔ (w <Q y ⋀ ¬ (*Q ‘y) ∈ A))) |
| 6 | 5 | exbidv 1281 | . . . . 5 ⊢ (z = w → (∃y(z <Q y ⋀ ¬ (*Q ‘y) ∈ A) ↔ ∃y(w <Q y ⋀ ¬ (*Q ‘y) ∈ A))) |
| 7 | 6 | cbvabv 1912 | . . . 4 ⊢ {z∣∃y(z <Q y ⋀ ¬ (*Q ‘y) ∈ A)} = {w∣∃y(w <Q y ⋀ ¬ (*Q ‘y) ∈ A)} |
| 8 | 7 | reclem2pr 5169 | . . 3 ⊢ (A ∈ P → {z∣∃y(z <Q y ⋀ ¬ (*Q ‘y) ∈ A)} ∈ P) |
| 9 | 7 | reclem4pr 5171 | . . 3 ⊢ (A ∈ P → (A ·P {z∣∃y(z <Q y ⋀ ¬ (*Q ‘y) ∈ A)}) = 1P) |
| 10 | 3, 8, 9 | sylc 68 | . 2 ⊢ (A ∈ P → ∃x(A ·P x) = 1P) |
| 11 | 1pr 5129 | . . . . . . 7 ⊢ 1P ∈ P | |
| 12 | eleq1 1537 | . . . . . . 7 ⊢ ((A ·P x) = 1P → ((A ·P x) ∈ P ↔ 1P ∈ P)) | |
| 13 | 11, 12 | mpbiri 194 | . . . . . 6 ⊢ ((A ·P x) = 1P → (A ·P x) ∈ P) |
| 14 | visset 1816 | . . . . . . 7 ⊢ x ∈ V | |
| 15 | dmmp 5128 | . . . . . . 7 ⊢ dom ·P = (P × P) | |
| 16 | 0npr 5108 | . . . . . . 7 ⊢ ¬ ∅ ∈ P | |
| 17 | 14, 15, 16 | ndmoprrcl 4052 | . . . . . 6 ⊢ ((A ·P x) ∈ P → (A ∈ P ⋀ x ∈ P)) |
| 18 | 13, 17 | syl 10 | . . . . 5 ⊢ ((A ·P x) = 1P → (A ∈ P ⋀ x ∈ P)) |
| 19 | 18 | pm3.27d 325 | . . . 4 ⊢ ((A ·P x) = 1P → x ∈ P) |
| 20 | 19 | ancri 297 | . . 3 ⊢ ((A ·P x) = 1P → (x ∈ P ⋀ (A ·P x) = 1P)) |
| 21 | 20 | 19.22i 1042 | . 2 ⊢ (∃x(A ·P x) = 1P → ∃x(x ∈ P ⋀ (A ·P x) = 1P)) |
| 22 | 10, 21 | syl 10 | 1 ⊢ (A ∈ P → ∃x(x ∈ P ⋀ (A ·P x) = 1P)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 2 → wi 3 ⋀ wa 223 = wceq 958 ∈ wcel 960 ∃wex 982 {cab 1466 class class class wbr 2624 ‘cfv 3188 (class class class)co 3969 *Qcrq 4995 <Q cltq 4996 Pcnp 4997 1Pc1p 4998 ·P cmp 5000 |
| This theorem is referenced by: recexsrlem 5224 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-9 967 ax-10 968 ax-11 969 ax-12 970 ax-13 971 ax-14 972 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 ax-rep 2698 ax-sep 2708 ax-nul 2715 ax-pow 2748 ax-pr 2785 ax-un 2872 ax-inf2 4634 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3or 778 df-3an 779 df-ex 983 df-sb 1174 df-eu 1384 df-mo 1385 df-clab 1467 df-cleq 1472 df-clel 1475 df-ne 1590 df-ral 1652 df-rex 1653 df-reu 1654 df-rab 1655 df-v 1815 df-sbc 1945 df-csb 2005 df-dif 2052 df-un 2053 df-in 2054 df-ss 2056 df-pss 2058 df-nul 2284 df-if 2366 df-pw 2406 df-sn 2416 df-pr 2417 df-tp 2419 df-op 2420 df-uni 2508 df-int 2538 df-iun 2572 df-br 2625 df-opab 2672 df-tr 2686 df-eprel 2838 df-id 2841 df-po 2846 df-so 2856 df-fr 2923 df-we 2940 df-ord 2957 df-on 2958 df-lim 2959 df-suc 2960 df-om 3138 df-xp 3190 df-rel 3191 df-cnv 3192 df-co 3193 df-dm 3194 df-rn 3195 df-res 3196 df-ima 3197 df-fun 3198 df-fn 3199 df-f 3200 df-fv 3204 df-rdg 3938 df-opr 3971 df-oprab 3972 df-1st 4085 df-2nd 4086 df-1o 4139 df-oadd 4141 df-omul 4142 df-er 4267 df-ec 4269 df-qs 4272 df-ni 5012 df-pli 5013 df-mi 5014 df-lti 5015 df-plpq 5047 df-mpq 5048 df-enq 5049 df-nq 5050 df-plq 5051 df-mq 5052 df-rq 5053 df-ltq 5054 df-1q 5055 df-np 5098 df-1p 5099 df-mp 5101 |