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

Theorem axpre-mulext 8202
Description: Strong extensionality of multiplication (expressed in terms of <). Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulext 8244.

(Contributed by Jim Kingdon, 18-Feb-2020.) (New usage is discouraged.)

Assertion
Ref Expression
axpre-mulext ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) → (𝐴 < 𝐵𝐵 < 𝐴)))

Proof of Theorem axpre-mulext
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elreal 8142 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥R𝑥, 0R⟩ = 𝐴)
2 elreal 8142 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦R𝑦, 0R⟩ = 𝐵)
3 elreal 8142 . 2 (𝐶 ∈ ℝ ↔ ∃𝑧R𝑧, 0R⟩ = 𝐶)
4 oveq1 6056 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = (𝐴 · ⟨𝑧, 0R⟩))
54breq1d 4118 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝐴 · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩)))
6 breq1 4111 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝐴 <𝑦, 0R⟩))
7 breq2 4112 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ <𝑥, 0R⟩ ↔ ⟨𝑦, 0R⟩ < 𝐴))
86, 7orbi12d 801 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴)))
95, 8imbi12d 234 . 2 (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩)) ↔ ((𝐴 · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴))))
10 oveq1 6056 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = (𝐵 · ⟨𝑧, 0R⟩))
1110breq2d 4120 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝐴 · ⟨𝑧, 0R⟩) < (𝐵 · ⟨𝑧, 0R⟩)))
12 breq2 4112 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <𝑦, 0R⟩ ↔ 𝐴 < 𝐵))
13 breq1 4111 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ < 𝐴𝐵 < 𝐴))
1412, 13orbi12d 801 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴) ↔ (𝐴 < 𝐵𝐵 < 𝐴)))
1511, 14imbi12d 234 . 2 (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (𝐴 <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ < 𝐴)) ↔ ((𝐴 · ⟨𝑧, 0R⟩) < (𝐵 · ⟨𝑧, 0R⟩) → (𝐴 < 𝐵𝐵 < 𝐴))))
16 oveq2 6057 . . . 4 (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 · ⟨𝑧, 0R⟩) = (𝐴 · 𝐶))
17 oveq2 6057 . . . 4 (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 · ⟨𝑧, 0R⟩) = (𝐵 · 𝐶))
1816, 17breq12d 4121 . . 3 (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 · ⟨𝑧, 0R⟩) < (𝐵 · ⟨𝑧, 0R⟩) ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶)))
1918imbi1d 231 . 2 (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 · ⟨𝑧, 0R⟩) < (𝐵 · ⟨𝑧, 0R⟩) → (𝐴 < 𝐵𝐵 < 𝐴)) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) → (𝐴 < 𝐵𝐵 < 𝐴))))
20 mulextsr1 8095 . . 3 ((𝑥R𝑦R𝑧R) → ((𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧) → (𝑥 <R 𝑦𝑦 <R 𝑥)))
21 mulresr 8152 . . . . . 6 ((𝑥R𝑧R) → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑥 ·R 𝑧), 0R⟩)
22213adant2 1043 . . . . 5 ((𝑥R𝑦R𝑧R) → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑥 ·R 𝑧), 0R⟩)
23 mulresr 8152 . . . . . 6 ((𝑦R𝑧R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
24233adant1 1042 . . . . 5 ((𝑥R𝑦R𝑧R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
2522, 24breq12d 4121 . . . 4 ((𝑥R𝑦R𝑧R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ ⟨(𝑥 ·R 𝑧), 0R⟩ < ⟨(𝑦 ·R 𝑧), 0R⟩))
26 ltresr 8153 . . . 4 (⟨(𝑥 ·R 𝑧), 0R⟩ < ⟨(𝑦 ·R 𝑧), 0R⟩ ↔ (𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧))
2725, 26bitrdi 196 . . 3 ((𝑥R𝑦R𝑧R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧)))
28 ltresr 8153 . . . . 5 (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
29 ltresr 8153 . . . . 5 (⟨𝑦, 0R⟩ <𝑥, 0R⟩ ↔ 𝑦 <R 𝑥)
3028, 29orbi12i 772 . . . 4 ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ (𝑥 <R 𝑦𝑦 <R 𝑥))
3130a1i 9 . . 3 ((𝑥R𝑦R𝑧R) → ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩) ↔ (𝑥 <R 𝑦𝑦 <R 𝑥)))
3220, 27, 313imtr4d 203 . 2 ((𝑥R𝑦R𝑧R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) < (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <𝑥, 0R⟩)))
331, 2, 3, 9, 15, 19, 323gencl 2847 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) → (𝐴 < 𝐵𝐵 < 𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wo 716  w3a 1005   = wceq 1398  wcel 2203  cop 3691   class class class wbr 4108  (class class class)co 6049  Rcnr 7611  0Rc0r 7612   ·R cmr 7616   <R cltr 7617  cr 8125   < cltrr 8130   · cmul 8131
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-2o 6647  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7618  df-pli 7619  df-mi 7620  df-lti 7621  df-plpq 7658  df-mpq 7659  df-enq 7661  df-nqqs 7662  df-plqqs 7663  df-mqqs 7664  df-1nqqs 7665  df-rq 7666  df-ltnqqs 7667  df-enq0 7738  df-nq0 7739  df-0nq0 7740  df-plq0 7741  df-mq0 7742  df-inp 7780  df-i1p 7781  df-iplp 7782  df-imp 7783  df-iltp 7784  df-enr 8040  df-nr 8041  df-plr 8042  df-mr 8043  df-ltr 8044  df-0r 8045  df-m1r 8047  df-c 8132  df-r 8136  df-mul 8138  df-lt 8139
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator