| 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 5103 | . . . . . 6 ⊢ (𝑧 = 𝑤 → (𝑧 <Q 𝑦 ↔ 𝑤 <Q 𝑦)) | |
| 2 | 1 | anbi1d 640 | . . . . 5 ⊢ (𝑧 = 𝑤 → ((𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ (𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 3 | 2 | exbidv 1941 | . . . 4 ⊢ (𝑧 = 𝑤 → (∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴) ↔ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴))) |
| 4 | 3 | cbvabv 2832 | . . 3 ⊢ {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} = {𝑤 ∣ ∃𝑦(𝑤 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} |
| 5 | 4 | reclem2pr 11006 | . 2 ⊢ (𝐴 ∈ P → {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} ∈ P) |
| 6 | 4 | reclem4pr 11008 | . 2 ⊢ (𝐴 ∈ P → (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P) |
| 7 | oveq2 7404 | . . . 4 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → (𝐴 ·P 𝑥) = (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)})) | |
| 8 | 7 | eqeq1d 2764 | . . 3 ⊢ (𝑥 = {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} → ((𝐴 ·P 𝑥) = 1P ↔ (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P)) |
| 9 | 8 | rspcev 3581 | . 2 ⊢ (({𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)} ∈ P ∧ (𝐴 ·P {𝑧 ∣ ∃𝑦(𝑧 <Q 𝑦 ∧ ¬ (*Q‘𝑦) ∈ 𝐴)}) = 1P) → ∃𝑥 ∈ P (𝐴 ·P 𝑥) = 1P) |
| 10 | 5, 6, 9 | syl2anc 593 | 1 ⊢ (𝐴 ∈ P → ∃𝑥 ∈ P (𝐴 ·P 𝑥) = 1P) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1560 ∃wex 1799 ∈ wcel 2142 {cab 2740 ∃wrex 3086 class class class wbr 5100 ‘cfv 6521 (class class class)co 7396 *Qcrq 10815 <Q cltq 10816 Pcnp 10817 1Pc1p 10818 ·P cmp 10820 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-inf2 9596 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-oadd 8441 df-omul 8442 df-er 8678 df-ni 10830 df-pli 10831 df-mi 10832 df-lti 10833 df-plpq 10866 df-mpq 10867 df-ltpq 10868 df-enq 10869 df-nq 10870 df-erq 10871 df-plq 10872 df-mq 10873 df-1nq 10874 df-rq 10875 df-ltnq 10876 df-np 10939 df-1p 10940 df-mp 10942 |
| This theorem is referenced by: recexsrlem 11061 |
| Copyright terms: Public domain | W3C validator |