| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > recexpr | Structured version Visualization version GIF version | ||
| Description: The reciprocal of a positive real exists. Part of Proposition 9-3.7(v) of [Gleason] p. 124. (Contributed by NM, 15-May-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| recexpr | ⊢ (𝐴 ∈ P → ∃𝑥 ∈ P (𝐴 ·P 𝑥) = 1P) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5099 | . . . . . 6 ⊢ (𝑧 = 𝑤 → (𝑧 <Q 𝑦 ↔ 𝑤 <Q 𝑦)) | |
| 2 | 1 | anbi1d 631 | . . . . 5 ⊢ (𝑧 = 𝑤 → ((𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ (𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 3 | 2 | exbidv 1922 | . . . 4 ⊢ (𝑧 = 𝑤 → (∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 4 | 3 | cbvabv 2804 | . . 3 ⊢ {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} = {𝑤 ∣ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} |
| 5 | 4 | reclem2pr 10957 | . 2 ⊢ (𝐴 ∈ P → {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} ∈ P) |
| 6 | 4 | reclem4pr 10959 | . 2 ⊢ (𝐴 ∈ P → (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P) |
| 7 | oveq2 7364 | . . . 4 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → (𝐴 ·P 𝑥) = (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)})) | |
| 8 | 7 | eqeq1d 2736 | . . 3 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → ((𝐴 ·P 𝑥) = 1P ↔ (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P)) |
| 9 | 8 | rspcev 3574 | . 2 ⊢ (({𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} ∈ P ∧ (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P) → ∃𝑥 ∈ P (𝐴 ·P 𝑥) = 1P) |
| 10 | 5, 6, 9 | syl2anc 584 | 1 ⊢ (𝐴 ∈ P → ∃𝑥 ∈ P (𝐴 ·P 𝑥) = 1P) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 {cab 2712 ∃wrex 3058 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 *Qcrq 10766 <Q cltq 10767 Pcnp 10768 1Pc1p 10769 ·P cmp 10771 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-inf2 9548 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-oadd 8399 df-omul 8400 df-er 8633 df-ni 10781 df-pli 10782 df-mi 10783 df-lti 10784 df-plpq 10817 df-mpq 10818 df-ltpq 10819 df-enq 10820 df-nq 10821 df-erq 10822 df-plq 10823 df-mq 10824 df-1nq 10825 df-rq 10826 df-ltnq 10827 df-np 10890 df-1p 10891 df-mp 10893 |
| This theorem is referenced by: recexsrlem 11012 |
| Copyright terms: Public domain | W3C validator |