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

Theorem axpre-mulgt0 8261
Description: The product of two positive reals is positive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 8303. (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 8202 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2 elreal 8202 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3 breq2 4135 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (0 <ℝ ⟨𝑥, 0R⟩ ↔ 0 <ℝ 𝐴))
43anbi1d 469 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩)))
5 oveq1 6095 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) = (𝐴 · ⟨𝑦, 0R⟩))
65breq2d 4143 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩)))
74, 6imbi12d 234 . 2 (⟨𝑥, 0R⟩ = 𝐴 → (((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩))))
8 breq2 4135 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0 <ℝ 𝐵))
98anbi2d 468 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵)))
10 oveq2 6096 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 · ⟨𝑦, 0R⟩) = (𝐴 · 𝐵))
1110breq2d 4143 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → (0 <ℝ (𝐴 · ⟨𝑦, 0R⟩) ↔ 0 <ℝ (𝐴 · 𝐵)))
129, 11imbi12d 234 . 2 (⟨𝑦, 0R⟩ = 𝐵 → (((0 <ℝ 𝐴 ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (𝐴 · ⟨𝑦, 0R⟩)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))))
13 df-0 8193 . . . . . 6 0 = ⟨0R, 0R⟩
1413breq1i 4138 . . . . 5 (0 <ℝ ⟨𝑥, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑥, 0R⟩)
15 ltresr 8213 . . . . 5 (⟨0R, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ 0R <R 𝑥)
1614, 15bitri 184 . . . 4 (0 <ℝ ⟨𝑥, 0R⟩ ↔ 0R <R 𝑥)
1713breq1i 4138 . . . . 5 (0 <ℝ ⟨𝑦, 0R⟩ ↔ ⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩)
18 ltresr 8213 . . . . 5 (⟨0R, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
1917, 18bitri 184 . . . 4 (0 <ℝ ⟨𝑦, 0R⟩ ↔ 0R <R 𝑦)
20 mulgt0sr 8152 . . . 4 ((0R <R 𝑥 ∧ 0R <R 𝑦) → 0R <R (𝑥 ·R 𝑦))
2116, 19, 20syl2anb 291 . . 3 ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0R <R (𝑥 ·R 𝑦))
2213a1i 9 . . . . 5 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 0 = ⟨0R, 0R⟩)
23 mulresr 8212 . . . . 5 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) = ⟨(𝑥 ·R 𝑦), 0R⟩)
2422, 23breq12d 4144 . . . 4 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ ⟨0R, 0R⟩ <ℝ ⟨(𝑥 ·R 𝑦), 0R⟩))
25 ltresr 8213 . . . 4 (⟨0R, 0R⟩ <ℝ ⟨(𝑥 ·R 𝑦), 0R⟩ ↔ 0R <R (𝑥 ·R 𝑦))
2624, 25bitrdi 196 . . 3 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩) ↔ 0R <R (𝑥 ·R 𝑦)))
2721, 26imbitrrid 156 . 2 ((𝑥 ∈ R ∧ 𝑦 ∈ R) → ((0 <ℝ ⟨𝑥, 0R⟩ ∧ 0 <ℝ ⟨𝑦, 0R⟩) → 0 <ℝ (⟨𝑥, 0R⟩ · ⟨𝑦, 0R⟩)))
281, 2, 7, 12, 272gencl 2855 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ⟨cop 3712   class class class wbr 4131  (class class class)co 6088  Rcnr 7671  0Rc0r 7672   ·R cmr 7676   <R cltr 7677  ℝcr 8185  0cc0 8186   <ℝ cltrr 8190   · cmul 8191
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7678  df-pli 7679  df-mi 7680  df-lti 7681  df-plpq 7718  df-mpq 7719  df-enq 7721  df-nqqs 7722  df-plqqs 7723  df-mqqs 7724  df-1nqqs 7725  df-rq 7726  df-ltnqqs 7727  df-enq0 7798  df-nq0 7799  df-0nq0 7800  df-plq0 7801  df-mq0 7802  df-inp 7840  df-i1p 7841  df-iplp 7842  df-imp 7843  df-iltp 7844  df-enr 8100  df-nr 8101  df-plr 8102  df-mr 8103  df-ltr 8104  df-0r 8105  df-m1r 8107  df-c 8192  df-0 8193  df-r 8196  df-mul 8198  df-lt 8199
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator