Theorem axprecex 8247

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 8289.

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.

Step	Hyp	Ref	Expression
1		elreal 8195	. . . 4 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐴)
2		df-rex 2534	. . . 4 ⊢ (∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐴 ↔ ∃𝑦(𝑦 ∈ R ∧ ⟨𝑦, 0R⟩ = 𝐴))
3	1, 2	bitri 184	. . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑦(𝑦 ∈ R ∧ ⟨𝑦, 0R⟩ = 𝐴))
4		breq2 4134	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0 <ℝ 𝐴))
5		oveq1 6092	. . . . . . 7 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ · 𝑥) = (𝐴 · 𝑥))
6	5	eqeq1d 2247	. . . . . 6 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → ((⟨𝑦, 0R⟩ · 𝑥) = 1 ↔ (𝐴 · 𝑥) = 1))
7	6	anbi2d 468	. . . . 5 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → ((0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ (0 <ℝ 𝑥 ∧ (𝐴 · 𝑥) = 1)))
8	7	rexbidv 2551	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → (∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (𝐴 · 𝑥) = 1)))
9	4, 8	imbi12d 234	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐴 → ((0 <ℝ ⟨𝑦, 0R⟩ → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)) ↔ (0 <ℝ 𝐴 → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (𝐴 · 𝑥) = 1))))
10		df-0 8186	. . . . . 6 ⊢ 0 = ⟨0R, 0R⟩
11	10	breq1i 4137	. . . . 5 ⊢ (0 <ℝ ⟨𝑦, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩)
12		ltresr 8206	. . . . 5 ⊢ (⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
13	11, 12	bitri 184	. . . 4 ⊢ (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
14		recexgt0sr 8140	. . . . 5 ⊢ (0R <R 𝑦 → ∃𝑧 ∈ R (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))
15		opelreal 8194	. . . . . . . . . 10 ⊢ (⟨𝑧, 0R⟩ ∈ ℝ ↔ 𝑧 ∈ R)
16	15	anbi1i 462	. . . . . . . . 9 ⊢ ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧 ∈ R ∧ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)))
17	10	breq1i 4137	. . . . . . . . . . . . 13 ⊢ (0 <ℝ ⟨𝑧, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑧, 0R⟩)
18		ltresr 8206	. . . . . . . . . . . . 13 ⊢ (⟨0R, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 0R <R 𝑧)
19	17, 18	bitri 184	. . . . . . . . . . . 12 ⊢ (0 <ℝ ⟨𝑧, 0R⟩ ↔ 0R <R 𝑧)
20	19	a1i 9	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → (0 <ℝ ⟨𝑧, 0R⟩ ↔ 0R <R 𝑧))
21		mulresr 8205	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
22	21	eqeq1d 2247	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1 ↔ ⟨(𝑦 ·R 𝑧), 0R⟩ = 1))
23		df-1 8187	. . . . . . . . . . . . . 14 ⊢ 1 = ⟨1R, 0R⟩
24	23	eqeq2i 2249	. . . . . . . . . . . . 13 ⊢ (⟨(𝑦 ·R 𝑧), 0R⟩ = 1 ↔ ⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩)
25		eqid 2238	. . . . . . . . . . . . . 14 ⊢ 0R = 0R
26		1sr 8118	. . . . . . . . . . . . . . 15 ⊢ 1R ∈ R
27		0r 8117	. . . . . . . . . . . . . . 15 ⊢ 0R ∈ R
28		opthg2 4379	. . . . . . . . . . . . . . 15 ⊢ ((1R ∈ R ∧ 0R ∈ R) → (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ ((𝑦 ·R 𝑧) = 1R ∧ 0R = 0R)))
29	26, 27, 28	mp2an 430	. . . . . . . . . . . . . 14 ⊢ (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ ((𝑦 ·R 𝑧) = 1R ∧ 0R = 0R))
30	25, 29	mpbiran2 954	. . . . . . . . . . . . 13 ⊢ (⟨(𝑦 ·R 𝑧), 0R⟩ = ⟨1R, 0R⟩ ↔ (𝑦 ·R 𝑧) = 1R)
31	24, 30	bitri 184	. . . . . . . . . . . 12 ⊢ (⟨(𝑦 ·R 𝑧), 0R⟩ = 1 ↔ (𝑦 ·R 𝑧) = 1R)
32	22, 31	bitrdi 196	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1 ↔ (𝑦 ·R 𝑧) = 1R))
33	20, 32	anbi12d 477	. . . . . . . . . 10 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → ((0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1) ↔ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R)))
34	33	pm5.32da 456	. . . . . . . . 9 ⊢ (𝑦 ∈ R → ((𝑧 ∈ R ∧ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧 ∈ R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))))
35	16, 34	bitrid 192	. . . . . . . 8 ⊢ (𝑦 ∈ R → ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) ↔ (𝑧 ∈ R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R))))
36		breq2 4134	. . . . . . . . . 10 ⊢ (𝑥 = ⟨𝑧, 0R⟩ → (0 <ℝ 𝑥 ↔ 0 <ℝ ⟨𝑧, 0R⟩))
37		oveq2 6093	. . . . . . . . . . 11 ⊢ (𝑥 = ⟨𝑧, 0R⟩ → (⟨𝑦, 0R⟩ · 𝑥) = (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩))
38	37	eqeq1d 2247	. . . . . . . . . 10 ⊢ (𝑥 = ⟨𝑧, 0R⟩ → ((⟨𝑦, 0R⟩ · 𝑥) = 1 ↔ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1))
39	36, 38	anbi12d 477	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑧, 0R⟩ → ((0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1) ↔ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)))
40	39	rspcev 2929	. . . . . . . 8 ⊢ ((⟨𝑧, 0R⟩ ∈ ℝ ∧ (0 <ℝ ⟨𝑧, 0R⟩ ∧ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = 1)) → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1))
41	35, 40	biimtrrdi 164	. . . . . . 7 ⊢ (𝑦 ∈ R → ((𝑧 ∈ R ∧ (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R)) → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
42	41	expd 258	. . . . . 6 ⊢ (𝑦 ∈ R → (𝑧 ∈ R → ((0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R) → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1))))
43	42	rexlimdv 2667	. . . . 5 ⊢ (𝑦 ∈ R → (∃𝑧 ∈ R (0R <R 𝑧 ∧ (𝑦 ·R 𝑧) = 1R) → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
44	14, 43	syl5 32	. . . 4 ⊢ (𝑦 ∈ R → (0R <R 𝑦 → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
45	13, 44	biimtrid 152	. . 3 ⊢ (𝑦 ∈ R → (0 <ℝ ⟨𝑦, 0R⟩ → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (⟨𝑦, 0R⟩ · 𝑥) = 1)))
46	3, 9, 45	gencl 2854	. 2 ⊢ (𝐴 ∈ ℝ → (0 <ℝ 𝐴 → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (𝐴 · 𝑥) = 1)))
47	46	imp 124	1 ⊢ ((𝐴 ∈ ℝ ∧ 0 <ℝ 𝐴) → ∃𝑥 ∈ ℝ (0 <ℝ 𝑥 ∧ (𝐴 · 𝑥) = 1))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∃wrex 2529  ⟨cop 3712   class class class wbr 4130  (class class class)co 6085  Rcnr 7664  0_Rc0r 7665  1_Rc1r 7666   ·_R cmr 7669   <_R cltr 7670  ℝcr 8178  0cc0 8179  1c1 8180   <_ℝ cltrr 8183   · cmul 8184

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-i1p 7834  df-iplp 7835  df-imp 7836  df-iltp 7837  df-enr 8093  df-nr 8094  df-plr 8095  df-mr 8096  df-ltr 8097  df-0r 8098  df-1r 8099  df-m1r 8100  df-c 8185  df-0 8186  df-1 8187  df-r 8189  df-mul 8191  df-lt 8192

This theorem is used by:  rereceu  8256  recriota  8257