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

Theorem axprecex 8000
Description: Existence of positive reciprocal of positive real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-precex 8042.

In treatments which assume excluded middle, the 0 < 𝐴 condition is generally replaced by 𝐴 ≠ 0, and it may not be necessary to state that the reciproacal is positive. (Contributed by Jim Kingdon, 6-Feb-2020.) (New usage is discouraged.)

Assertion
Ref Expression
axprecex ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1))
Distinct variable group:   𝑥,𝐴

Proof of Theorem axprecex
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elreal 7948 . . . 4 (𝐴 ∈ ℝ ↔ ∃𝑦R𝑦, 0R⟩ = 𝐴)
2 df-rex 2491 . . . 4 (∃𝑦R𝑦, 0R⟩ = 𝐴 ↔ ∃𝑦(𝑦R ∧ ⟨𝑦, 0R⟩ = 𝐴))
31, 2bitri 184 . . 3 (𝐴 ∈ ℝ ↔ ∃𝑦(𝑦R ∧ ⟨𝑦, 0R⟩ = 𝐴))
4 breq2 4051 . . . 4 (⟨𝑦, 0R⟩ = 𝐴 → (0 <𝑦, 0R⟩ ↔ 0 < 𝐴))
5 oveq1 5958 . . . . . . 7 (⟨𝑦, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ · 𝑥) = (𝐴 · 𝑥))
65eqeq1d 2215 . . . . . 6 (⟨𝑦, 0R⟩ = 𝐴 → ((⟨𝑦, 0R⟩ · 𝑥) = 1 ↔ (𝐴 · 𝑥) = 1))
76anbi2d 464 . . . . 5 (⟨𝑦, 0R⟩ = 𝐴 → ((0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1)))
87rexbidv 2508 . . . 4 (⟨𝑦, 0R⟩ = 𝐴 → (∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1)))
94, 8imbi12d 234 . . 3 (⟨𝑦, 0R⟩ = 𝐴 → ((0 <𝑦, 0R⟩ → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)) ↔ (0 < 𝐴 → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1))))
10 df-0 7939 . . . . . 6 0 = ⟨0R, 0R
1110breq1i 4054 . . . . 5 (0 <𝑦, 0R⟩ ↔ ⟨0R, 0R⟩ <𝑦, 0R⟩)
12 ltresr 7959 . . . . 5 (⟨0R, 0R⟩ <𝑦, 0R⟩ ↔ 0R <R 𝑦)
1311, 12bitri 184 . . . 4 (0 <𝑦, 0R⟩ ↔ 0R <R 𝑦)
14 recexgt0sr 7893 . . . . 5 (0R <R 𝑦 → ∃𝑧R (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))
15 opelreal 7947 . . . . . . . . . 10 (⟨𝑧, 0R⟩ ∈ ℝ ↔ 𝑧R)
1615anbi1i 458 . . . . . . . . 9 ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧R ∧ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)))
1710breq1i 4054 . . . . . . . . . . . . 13 (0 <𝑧, 0R⟩ ↔ ⟨0R, 0R⟩ <𝑧, 0R⟩)
18 ltresr 7959 . . . . . . . . . . . . 13 (⟨0R, 0R⟩ <𝑧, 0R⟩ ↔ 0R <R 𝑧)
1917, 18bitri 184 . . . . . . . . . . . 12 (0 <𝑧, 0R⟩ ↔ 0R <R 𝑧)
2019a1i 9 . . . . . . . . . . 11 ((𝑦R𝑧R) → (0 <𝑧, 0R⟩ ↔ 0R <R 𝑧))
21 mulresr 7958 . . . . . . . . . . . . 13 ((𝑦R𝑧R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
2221eqeq1d 2215 . . . . . . . . . . . 12 ((𝑦R𝑧R) → ((⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1 ↔ ⟨(𝑦 ·R 𝑧), 0R⟩ = 1))
23 df-1 7940 . . . . . . . . . . . . . 14 1 = ⟨1R, 0R
2423eqeq2i 2217 . . . . . . . . . . . . 13 (⟨(𝑦 ·R 𝑧), 0R⟩ = 1 ↔ ⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩)
25 eqid 2206 . . . . . . . . . . . . . 14 0R = 0R
26 1sr 7871 . . . . . . . . . . . . . . 15 1RR
27 0r 7870 . . . . . . . . . . . . . . 15 0RR
28 opthg2 4287 . . . . . . . . . . . . . . 15 ((1RR ∧ 0RR) → (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ ((𝑦 ·R 𝑧) = 1R ∧ 0R = 0R)))
2926, 27, 28mp2an 426 . . . . . . . . . . . . . 14 (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ ((𝑦 ·R 𝑧) = 1R ∧ 0R = 0R))
3025, 29mpbiran2 944 . . . . . . . . . . . . 13 (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ (𝑦 ·R 𝑧) = 1R)
3124, 30bitri 184 . . . . . . . . . . . 12 (⟨(𝑦 ·R 𝑧), 0R⟩ = 1 ↔ (𝑦 ·R 𝑧) = 1R)
3222, 31bitrdi 196 . . . . . . . . . . 11 ((𝑦R𝑧R) → ((⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1 ↔ (𝑦 ·R 𝑧) = 1R))
3320, 32anbi12d 473 . . . . . . . . . 10 ((𝑦R𝑧R) → ((0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1) ↔ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R)))
3433pm5.32da 452 . . . . . . . . 9 (𝑦R → ((𝑧R ∧ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))))
3516, 34bitrid 192 . . . . . . . 8 (𝑦R → ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))))
36 breq2 4051 . . . . . . . . . 10 (𝑥 = ⟨𝑧, 0R⟩ → (0 < 𝑥 ↔ 0 <𝑧, 0R⟩))
37 oveq2 5959 . . . . . . . . . . 11 (𝑥 = ⟨𝑧, 0R⟩ → (⟨𝑦, 0R⟩ · 𝑥) = (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩))
3837eqeq1d 2215 . . . . . . . . . 10 (𝑥 = ⟨𝑧, 0R⟩ → ((⟨𝑦, 0R⟩ · 𝑥) = 1 ↔ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1))
3936, 38anbi12d 473 . . . . . . . . 9 (𝑥 = ⟨𝑧, 0R⟩ → ((0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)))
4039rspcev 2878 . . . . . . . 8 ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1))
4135, 40biimtrrdi 164 . . . . . . 7 (𝑦R → ((𝑧R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R)) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
4241expd 258 . . . . . 6 (𝑦R → (𝑧R → ((0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1))))
4342rexlimdv 2623 . . . . 5 (𝑦R → (∃𝑧R (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
4414, 43syl5 32 . . . 4 (𝑦R → (0R <R 𝑦 → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
4513, 44biimtrid 152 . . 3 (𝑦R → (0 <𝑦, 0R⟩ → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
463, 9, 45gencl 2805 . 2 (𝐴 ∈ ℝ → (0 < 𝐴 → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1)))
4746imp 124 1 ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ (𝐴 · 𝑥) = 1))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wex 1516  wcel 2177  wrex 2486  cop 3637   class class class wbr 4047  (class class class)co 5951  Rcnr 7417  0Rc0r 7418  1Rc1r 7419   ·R cmr 7422   <R cltr 7423  cr 7931  0cc0 7932  1c1 7933   < cltrr 7936   · cmul 7937
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-eprel 4340  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-1o 6509  df-2o 6510  df-oadd 6513  df-omul 6514  df-er 6627  df-ec 6629  df-qs 6633  df-ni 7424  df-pli 7425  df-mi 7426  df-lti 7427  df-plpq 7464  df-mpq 7465  df-enq 7467  df-nqqs 7468  df-plqqs 7469  df-mqqs 7470  df-1nqqs 7471  df-rq 7472  df-ltnqqs 7473  df-enq0 7544  df-nq0 7545  df-0nq0 7546  df-plq0 7547  df-mq0 7548  df-inp 7586  df-i1p 7587  df-iplp 7588  df-imp 7589  df-iltp 7590  df-enr 7846  df-nr 7847  df-plr 7848  df-mr 7849  df-ltr 7850  df-0r 7851  df-1r 7852  df-m1r 7853  df-c 7938  df-0 7939  df-1 7940  df-r 7942  df-mul 7944  df-lt 7945
This theorem is referenced by:  rereceu  8009  recriota  8010
  Copyright terms: Public domain W3C validator