| 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 5112 | . . . . . 6 ⊢ (𝑧 = 𝑤 → (𝑧 <Q 𝑦 ↔ 𝑤 <Q 𝑦)) | |
| 2 | 1 | anbi1d 631 | . . . . 5 ⊢ (𝑧 = 𝑤 → ((𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ (𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 3 | 2 | exbidv 1921 | . . . 4 ⊢ (𝑧 = 𝑤 → (∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 4 | 3 | cbvabv 2800 | . . 3 ⊢ {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} = {𝑤 ∣ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} |
| 5 | 4 | reclem2pr 11007 | . 2 ⊢ (𝐴 ∈ P → {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} ∈ P) |
| 6 | 4 | reclem4pr 11009 | . 2 ⊢ (𝐴 ∈ P → (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P) |
| 7 | oveq2 7397 | . . . 4 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → (𝐴 ·P 𝑥) = (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)})) | |
| 8 | 7 | eqeq1d 2732 | . . 3 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → ((𝐴 ·P 𝑥) = 1P ↔ (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P)) |
| 9 | 8 | rspcev 3591 | . 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 1540 ∃wex 1779 ∈ wcel 2109 {cab 2708 ∃wrex 3054 class class class wbr 5109 ‘cfv 6513 (class class class)co 7389 *Qcrq 10816 <Q cltq 10817 Pcnp 10818 1Pc1p 10819 ·P cmp 10821 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-inf2 9600 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-oadd 8440 df-omul 8441 df-er 8673 df-ni 10831 df-pli 10832 df-mi 10833 df-lti 10834 df-plpq 10867 df-mpq 10868 df-ltpq 10869 df-enq 10870 df-nq 10871 df-erq 10872 df-plq 10873 df-mq 10874 df-1nq 10875 df-rq 10876 df-ltnq 10877 df-np 10940 df-1p 10941 df-mp 10943 |
| This theorem is referenced by: recexsrlem 11062 |
| Copyright terms: Public domain | W3C validator |