MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axpre-mulgt0 Structured version   Visualization version   GIF version

Theorem axpre-mulgt0 11292
Description: The product of two positive reals is positive. Axiom 21 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version for extended reals is axmulgt0 11423. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 11316. (Contributed by NM, 13-May-1996.) (New usage is discouraged.)
Assertion
Ref Expression
axpre-mulgt0 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵)))

Proof of Theorem axpre-mulgt0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elreal 11255 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2 elreal 11255 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3 breq2 5112 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (0 <ℝ ⟨𝑥, 0R⟩ ↔ 0 <ℝ 𝐴))
43anbi1d 643 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩)))
5 oveq1 7458 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) = (𝐴 · ⟨𝑦, 0R⟩))
65breq2d 5120 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩)))
74, 6imbi12d 347 . 2 (⟨𝑥, 0R⟩ = 𝐴 → (((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩))))
8 breq2 5112 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0 <ℝ 𝐵))
98anbi2d 642 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵)))
10 oveq2 7459 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 · ⟨𝑦, 0R⟩) = (𝐴 · 𝐵))
1110breq2d 5120 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → (0 <ℝ (𝐴 · ⟨𝑦, 0R⟩) ↔ 0 <ℝ (𝐴 · 𝐵)))
129, 11imbi12d 347 . 2 (⟨𝑦, 0R⟩ = 𝐵 → (((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))))
13 df-0 11246 . . . . . 6 0 = ⟨0R, 0R⟩
1413breq1i 5115 . . . . 5 (0 <ℝ ⟨𝑥, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑥, 0R⟩)
15 ltresr 11264 . . . . 5 (⟨0R, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ 0R <R 𝑥)
1614, 15bitri 278 . . . 4 (0 <ℝ ⟨𝑥, 0R⟩ ↔ 0R <R 𝑥)
1713breq1i 5115 . . . . 5 (0 <ℝ ⟨𝑦, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩)
18 ltresr 11264 . . . . 5 (⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
1917, 18bitri 278 . . . 4 (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
20 mulgt0sr 11229 . . . 4 ((0R <R 𝑥 ∧ 0R <R 𝑦) → 0R <R (𝑥 ·R 𝑦))
2116, 19, 20syl2anb 610 . . 3 ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0R <R (𝑥 ·R 𝑦))
2213a1i 11 . . . . 5 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 0 = ⟨0R, 0R⟩)
23 mulresr 11263 . . . . 5 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) = ⟨(𝑥 ·R 𝑦), 0R⟩)
2422, 23breq12d 5121 . . . 4 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ ⟨0R, 0R⟩ <ℝ ⟨(𝑥 ·R 𝑦), 0R⟩))
25 ltresr 11264 . . . 4 (⟨0R, 0R⟩ <ℝ ⟨(𝑥 ·R 𝑦), 0R⟩ ↔ 0R <R (𝑥 ·R 𝑦))
2624, 25bitrdi 290 . . 3 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ 0R <R (𝑥 ·R 𝑦)))
2721, 26imbitrrid 249 . 2 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩)))
281, 2, 7, 12, 272gencl 3496 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4840   class class class wbr 5108  (class class class)co 7451  Rcnr 10989  0Rc0r 10990   ·R cmr 10994   <R cltr 10995  ℝcr 11238  0cc0 11239   <ℝ cltrr 11243   · cmul 11244
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-omul 8519  df-er 8755  df-ec 8757  df-qs 8761  df-ni 10996  df-pli 10997  df-mi 10998  df-lti 10999  df-plpq 11032  df-mpq 11033  df-ltpq 11034  df-enq 11035  df-nq 11036  df-erq 11037  df-plq 11038  df-mq 11039  df-1nq 11040  df-rq 11041  df-ltnq 11042  df-np 11105  df-1p 11106  df-plp 11107  df-mp 11108  df-ltp 11109  df-enr 11179  df-nr 11180  df-plr 11181  df-mr 11182  df-ltr 11183  df-0r 11184  df-m1r 11186  df-c 11245  df-0 11246  df-r 11249  df-mul 11251  df-lt 11252
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator