Theorem axpre-mulext 6772

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

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

Assertion

Ref	Expression
axpre-mulext	⊢ ((A ∈ ℝ ∧ B ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((A · 𝐶) <ℝ (B · 𝐶) → (A <ℝ B ∨ B <ℝ A)))

Proof of Theorem axpre-mulext

Dummy variables x y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elreal 6727	. 2 ⊢ (A ∈ ℝ ↔ ∃x ∈ R ⟨x, 0R⟩ = A)
2		elreal 6727	. 2 ⊢ (B ∈ ℝ ↔ ∃y ∈ R ⟨y, 0R⟩ = B)
3		elreal 6727	. 2 ⊢ (𝐶 ∈ ℝ ↔ ∃z ∈ R ⟨z, 0R⟩ = 𝐶)
4		oveq1 5462	. . . 4 ⊢ (⟨x, 0R⟩ = A → (⟨x, 0R⟩ · ⟨z, 0R⟩) = (A · ⟨z, 0R⟩))
5	4	breq1d 3765	. . 3 ⊢ (⟨x, 0R⟩ = A → ((⟨x, 0R⟩ · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) ↔ (A · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩)))
6		breq1 3758	. . . 4 ⊢ (⟨x, 0R⟩ = A → (⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ↔ A <ℝ ⟨y, 0R⟩))
7		breq2 3759	. . . 4 ⊢ (⟨x, 0R⟩ = A → (⟨y, 0R⟩ <ℝ ⟨x, 0R⟩ ↔ ⟨y, 0R⟩ <ℝ A))
8	6, 7	orbi12d 706	. . 3 ⊢ (⟨x, 0R⟩ = A → ((⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ ⟨x, 0R⟩) ↔ (A <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ A)))
9	5, 8	imbi12d 223	. 2 ⊢ (⟨x, 0R⟩ = A → (((⟨x, 0R⟩ · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) → (⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ ⟨x, 0R⟩)) ↔ ((A · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) → (A <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ A))))
10		oveq1 5462	. . . 4 ⊢ (⟨y, 0R⟩ = B → (⟨y, 0R⟩ · ⟨z, 0R⟩) = (B · ⟨z, 0R⟩))
11	10	breq2d 3767	. . 3 ⊢ (⟨y, 0R⟩ = B → ((A · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) ↔ (A · ⟨z, 0R⟩) <ℝ (B · ⟨z, 0R⟩)))
12		breq2 3759	. . . 4 ⊢ (⟨y, 0R⟩ = B → (A <ℝ ⟨y, 0R⟩ ↔ A <ℝ B))
13		breq1 3758	. . . 4 ⊢ (⟨y, 0R⟩ = B → (⟨y, 0R⟩ <ℝ A ↔ B <ℝ A))
14	12, 13	orbi12d 706	. . 3 ⊢ (⟨y, 0R⟩ = B → ((A <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ A) ↔ (A <ℝ B ∨ B <ℝ A)))
15	11, 14	imbi12d 223	. 2 ⊢ (⟨y, 0R⟩ = B → (((A · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) → (A <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ A)) ↔ ((A · ⟨z, 0R⟩) <ℝ (B · ⟨z, 0R⟩) → (A <ℝ B ∨ B <ℝ A))))
16		oveq2 5463	. . . 4 ⊢ (⟨z, 0R⟩ = 𝐶 → (A · ⟨z, 0R⟩) = (A · 𝐶))
17		oveq2 5463	. . . 4 ⊢ (⟨z, 0R⟩ = 𝐶 → (B · ⟨z, 0R⟩) = (B · 𝐶))
18	16, 17	breq12d 3768	. . 3 ⊢ (⟨z, 0R⟩ = 𝐶 → ((A · ⟨z, 0R⟩) <ℝ (B · ⟨z, 0R⟩) ↔ (A · 𝐶) <ℝ (B · 𝐶)))
19	18	imbi1d 220	. 2 ⊢ (⟨z, 0R⟩ = 𝐶 → (((A · ⟨z, 0R⟩) <ℝ (B · ⟨z, 0R⟩) → (A <ℝ B ∨ B <ℝ A)) ↔ ((A · 𝐶) <ℝ (B · 𝐶) → (A <ℝ B ∨ B <ℝ A))))
20		mulextsr1 6707	. . 3 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → ((x ·R z) <R (y ·R z) → (x <R y ∨ y <R x)))
21		mulresr 6735	. . . . . 6 ⊢ ((x ∈ R ∧ z ∈ R) → (⟨x, 0R⟩ · ⟨z, 0R⟩) = ⟨(x ·R z), 0R⟩)
22	21	3adant2 922	. . . . 5 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → (⟨x, 0R⟩ · ⟨z, 0R⟩) = ⟨(x ·R z), 0R⟩)
23		mulresr 6735	. . . . . 6 ⊢ ((y ∈ R ∧ z ∈ R) → (⟨y, 0R⟩ · ⟨z, 0R⟩) = ⟨(y ·R z), 0R⟩)
24	23	3adant1 921	. . . . 5 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → (⟨y, 0R⟩ · ⟨z, 0R⟩) = ⟨(y ·R z), 0R⟩)
25	22, 24	breq12d 3768	. . . 4 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → ((⟨x, 0R⟩ · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) ↔ ⟨(x ·R z), 0R⟩ <ℝ ⟨(y ·R z), 0R⟩))
26		ltresr 6736	. . . 4 ⊢ (⟨(x ·R z), 0R⟩ <ℝ ⟨(y ·R z), 0R⟩ ↔ (x ·R z) <R (y ·R z))
27	25, 26	syl6bb 185	. . 3 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → ((⟨x, 0R⟩ · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) ↔ (x ·R z) <R (y ·R z)))
28		ltresr 6736	. . . . 5 ⊢ (⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ↔ x <R y)
29		ltresr 6736	. . . . 5 ⊢ (⟨y, 0R⟩ <ℝ ⟨x, 0R⟩ ↔ y <R x)
30	28, 29	orbi12i 680	. . . 4 ⊢ ((⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ ⟨x, 0R⟩) ↔ (x <R y ∨ y <R x))
31	30	a1i 9	. . 3 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → ((⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ ⟨x, 0R⟩) ↔ (x <R y ∨ y <R x)))
32	20, 27, 31	3imtr4d 192	. 2 ⊢ ((x ∈ R ∧ y ∈ R ∧ z ∈ R) → ((⟨x, 0R⟩ · ⟨z, 0R⟩) <ℝ (⟨y, 0R⟩ · ⟨z, 0R⟩) → (⟨x, 0R⟩ <ℝ ⟨y, 0R⟩ ∨ ⟨y, 0R⟩ <ℝ ⟨x, 0R⟩)))
33	1, 2, 3, 9, 15, 19, 32	3gencl 2582	1 ⊢ ((A ∈ ℝ ∧ B ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((A · 𝐶) <ℝ (B · 𝐶) → (A <ℝ B ∨ B <ℝ A)))

Syntax hints:   → wi 4   ↔ wb 98   ∨ wo 628   ∧ w3a 884   = wceq 1242   ∈ wcel 1390  ⟨cop 3370   class class class wbr 3755  (class class class)co 5455  Rcnr 6281  0_Rc0r 6282   ·_R cmr 6286   <_R cltr 6287  ℝcr 6710   <_ℝ cltrr 6715   · cmul 6716

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-13 1401  ax-14 1402  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019  ax-coll 3863  ax-sep 3866  ax-nul 3874  ax-pow 3918  ax-pr 3935  ax-un 4136  ax-setind 4220  ax-iinf 4254

This theorem depends on definitions:  df-bi 110  df-dc 742  df-3or 885  df-3an 886  df-tru 1245  df-fal 1248  df-nf 1347  df-sb 1643  df-eu 1900  df-mo 1901  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ne 2203  df-ral 2305  df-rex 2306  df-reu 2307  df-rab 2309  df-v 2553  df-sbc 2759  df-csb 2847  df-dif 2914  df-un 2916  df-in 2918  df-ss 2925  df-nul 3219  df-pw 3353  df-sn 3373  df-pr 3374  df-op 3376  df-uni 3572  df-int 3607  df-iun 3650  df-br 3756  df-opab 3810  df-mpt 3811  df-tr 3846  df-eprel 4017  df-id 4021  df-po 4024  df-iso 4025  df-iord 4069  df-on 4071  df-suc 4074  df-iom 4257  df-xp 4294  df-rel 4295  df-cnv 4296  df-co 4297  df-dm 4298  df-rn 4299  df-res 4300  df-ima 4301  df-iota 4810  df-fun 4847  df-fn 4848  df-f 4849  df-f1 4850  df-fo 4851  df-f1o 4852  df-fv 4853  df-ov 5458  df-oprab 5459  df-mpt2 5460  df-1st 5709  df-2nd 5710  df-recs 5861  df-irdg 5897  df-1o 5940  df-2o 5941  df-oadd 5944  df-omul 5945  df-er 6042  df-ec 6044  df-qs 6048  df-ni 6288  df-pli 6289  df-mi 6290  df-lti 6291  df-plpq 6328  df-mpq 6329  df-enq 6331  df-nqqs 6332  df-plqqs 6333  df-mqqs 6334  df-1nqqs 6335  df-rq 6336  df-ltnqqs 6337  df-enq0 6407  df-nq0 6408  df-0nq0 6409  df-plq0 6410  df-mq0 6411  df-inp 6449  df-i1p 6450  df-iplp 6451  df-imp 6452  df-iltp 6453  df-enr 6654  df-nr 6655  df-plr 6656  df-mr 6657  df-ltr 6658  df-0r 6659  df-m1r 6661  df-c 6717  df-r 6721  df-mul 6723  df-lt 6724

This theorem is referenced by: (None)