ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  recexpr GIF version

Theorem recexpr 7141
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.)
Assertion
Ref Expression
recexpr (𝐴P → ∃𝑥P (𝐴 ·P 𝑥) = 1P)
Distinct variable group:   𝑥,𝐴

Proof of Theorem recexpr
Dummy variables 𝑢 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq12 3825 . . . . . . 7 ((𝑧 = 𝑢𝑤 = 𝑣) → (𝑧 <Q 𝑤𝑢 <Q 𝑣))
2 simpr 108 . . . . . . . . 9 ((𝑧 = 𝑢𝑤 = 𝑣) → 𝑤 = 𝑣)
32fveq2d 5272 . . . . . . . 8 ((𝑧 = 𝑢𝑤 = 𝑣) → (*Q𝑤) = (*Q𝑣))
43eleq1d 2153 . . . . . . 7 ((𝑧 = 𝑢𝑤 = 𝑣) → ((*Q𝑤) ∈ (2nd𝐴) ↔ (*Q𝑣) ∈ (2nd𝐴)))
51, 4anbi12d 457 . . . . . 6 ((𝑧 = 𝑢𝑤 = 𝑣) → ((𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴)) ↔ (𝑢 <Q 𝑣 ∧ (*Q𝑣) ∈ (2nd𝐴))))
65cbvexdva 1849 . . . . 5 (𝑧 = 𝑢 → (∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴)) ↔ ∃𝑣(𝑢 <Q 𝑣 ∧ (*Q𝑣) ∈ (2nd𝐴))))
76cbvabv 2208 . . . 4 {𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))} = {𝑢 ∣ ∃𝑣(𝑢 <Q 𝑣 ∧ (*Q𝑣) ∈ (2nd𝐴))}
8 simpl 107 . . . . . . . 8 ((𝑧 = 𝑢𝑤 = 𝑣) → 𝑧 = 𝑢)
92, 8breq12d 3833 . . . . . . 7 ((𝑧 = 𝑢𝑤 = 𝑣) → (𝑤 <Q 𝑧𝑣 <Q 𝑢))
103eleq1d 2153 . . . . . . 7 ((𝑧 = 𝑢𝑤 = 𝑣) → ((*Q𝑤) ∈ (1st𝐴) ↔ (*Q𝑣) ∈ (1st𝐴)))
119, 10anbi12d 457 . . . . . 6 ((𝑧 = 𝑢𝑤 = 𝑣) → ((𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴)) ↔ (𝑣 <Q 𝑢 ∧ (*Q𝑣) ∈ (1st𝐴))))
1211cbvexdva 1849 . . . . 5 (𝑧 = 𝑢 → (∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴)) ↔ ∃𝑣(𝑣 <Q 𝑢 ∧ (*Q𝑣) ∈ (1st𝐴))))
1312cbvabv 2208 . . . 4 {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))} = {𝑢 ∣ ∃𝑣(𝑣 <Q 𝑢 ∧ (*Q𝑣) ∈ (1st𝐴))}
147, 13opeq12i 3610 . . 3 ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩ = ⟨{𝑢 ∣ ∃𝑣(𝑢 <Q 𝑣 ∧ (*Q𝑣) ∈ (2nd𝐴))}, {𝑢 ∣ ∃𝑣(𝑣 <Q 𝑢 ∧ (*Q𝑣) ∈ (1st𝐴))}⟩
1514recexprlempr 7135 . 2 (𝐴P → ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩ ∈ P)
1614recexprlemex 7140 . 2 (𝐴P → (𝐴 ·P ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩) = 1P)
17 oveq2 5621 . . . 4 (𝑥 = ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩ → (𝐴 ·P 𝑥) = (𝐴 ·P ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩))
1817eqeq1d 2093 . . 3 (𝑥 = ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩ → ((𝐴 ·P 𝑥) = 1P ↔ (𝐴 ·P ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩) = 1P))
1918rspcev 2715 . 2 ((⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩ ∈ P ∧ (𝐴 ·P ⟨{𝑧 ∣ ∃𝑤(𝑧 <Q 𝑤 ∧ (*Q𝑤) ∈ (2nd𝐴))}, {𝑧 ∣ ∃𝑤(𝑤 <Q 𝑧 ∧ (*Q𝑤) ∈ (1st𝐴))}⟩) = 1P) → ∃𝑥P (𝐴 ·P 𝑥) = 1P)
2015, 16, 19syl2anc 403 1 (𝐴P → ∃𝑥P (𝐴 ·P 𝑥) = 1P)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102   = wceq 1287  wex 1424  wcel 1436  {cab 2071  wrex 2356  cop 3434   class class class wbr 3820  cfv 4981  (class class class)co 5613  1st c1st 5866  2nd c2nd 5867  *Qcrq 6787   <Q cltq 6788  Pcnp 6794  1Pc1p 6795   ·P cmp 6797
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-13 1447  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-coll 3929  ax-sep 3932  ax-nul 3940  ax-pow 3984  ax-pr 4010  ax-un 4234  ax-setind 4326  ax-iinf 4376
This theorem depends on definitions:  df-bi 115  df-dc 779  df-3or 923  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-ral 2360  df-rex 2361  df-reu 2362  df-rab 2364  df-v 2617  df-sbc 2830  df-csb 2923  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-nul 3276  df-pw 3417  df-sn 3437  df-pr 3438  df-op 3440  df-uni 3637  df-int 3672  df-iun 3715  df-br 3821  df-opab 3875  df-mpt 3876  df-tr 3912  df-eprel 4090  df-id 4094  df-po 4097  df-iso 4098  df-iord 4167  df-on 4169  df-suc 4172  df-iom 4379  df-xp 4417  df-rel 4418  df-cnv 4419  df-co 4420  df-dm 4421  df-rn 4422  df-res 4423  df-ima 4424  df-iota 4946  df-fun 4983  df-fn 4984  df-f 4985  df-f1 4986  df-fo 4987  df-f1o 4988  df-fv 4989  df-ov 5616  df-oprab 5617  df-mpt2 5618  df-1st 5868  df-2nd 5869  df-recs 6024  df-irdg 6089  df-1o 6135  df-2o 6136  df-oadd 6139  df-omul 6140  df-er 6244  df-ec 6246  df-qs 6250  df-ni 6807  df-pli 6808  df-mi 6809  df-lti 6810  df-plpq 6847  df-mpq 6848  df-enq 6850  df-nqqs 6851  df-plqqs 6852  df-mqqs 6853  df-1nqqs 6854  df-rq 6855  df-ltnqqs 6856  df-enq0 6927  df-nq0 6928  df-0nq0 6929  df-plq0 6930  df-mq0 6931  df-inp 6969  df-i1p 6970  df-imp 6972
This theorem is referenced by:  ltmprr  7145  recexgt0sr  7263
  Copyright terms: Public domain W3C validator