Theorem axpre-mulext 8151

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

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

Step	Hyp	Ref	Expression
1		elreal 8091	. 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2		elreal 8091	. 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3		elreal 8091	. 2 ⊢ (𝐶 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐶)
4		oveq1 6035	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = (𝐴 · ⟨𝑧, 0R⟩))
5	4	breq1d 4103	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝐴 · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩)))
6		breq1 4096	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩))
7		breq2 4097	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ ⟨𝑦, 0R⟩ <ℝ 𝐴))
8	6, 7	orbi12d 801	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴)))
9	5, 8	imbi12d 234	. 2 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩)) ↔ ((𝐴 · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (𝐴 <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴))))
10		oveq1 6035	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = (𝐵 · ⟨𝑧, 0R⟩))
11	10	breq2d 4105	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝐴 · ⟨𝑧, 0R⟩) <ℝ (𝐵 · ⟨𝑧, 0R⟩)))
12		breq2 4097	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵))
13		breq1 4096	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <ℝ 𝐴 ↔ 𝐵 <ℝ 𝐴))
14	12, 13	orbi12d 801	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴) ↔ (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴)))
15	11, 14	imbi12d 234	. 2 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (𝐴 <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ 𝐴)) ↔ ((𝐴 · ⟨𝑧, 0R⟩) <ℝ (𝐵 · ⟨𝑧, 0R⟩) → (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴))))
16		oveq2 6036	. . . 4 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 · ⟨𝑧, 0R⟩) = (𝐴 · 𝐶))
17		oveq2 6036	. . . 4 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 · ⟨𝑧, 0R⟩) = (𝐵 · 𝐶))
18	16, 17	breq12d 4106	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 · ⟨𝑧, 0R⟩) <ℝ (𝐵 · ⟨𝑧, 0R⟩) ↔ (𝐴 · 𝐶) <ℝ (𝐵 · 𝐶)))
19	18	imbi1d 231	. 2 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 · ⟨𝑧, 0R⟩) <ℝ (𝐵 · ⟨𝑧, 0R⟩) → (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴)) ↔ ((𝐴 · 𝐶) <ℝ (𝐵 · 𝐶) → (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴))))
20		mulextsr1 8044	. . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧) → (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥)))
21		mulresr 8101	. . . . . 6 ⊢ ((𝑥 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑥 ·R 𝑧), 0R⟩)
22	21	3adant2 1043	. . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑥 ·R 𝑧), 0R⟩)
23		mulresr 8101	. . . . . 6 ⊢ ((𝑦 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
24	23	3adant1 1042	. . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) = ⟨(𝑦 ·R 𝑧), 0R⟩)
25	22, 24	breq12d 4106	. . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ ⟨(𝑥 ·R 𝑧), 0R⟩ <ℝ ⟨(𝑦 ·R 𝑧), 0R⟩))
26		ltresr 8102	. . . 4 ⊢ (⟨(𝑥 ·R 𝑧), 0R⟩ <ℝ ⟨(𝑦 ·R 𝑧), 0R⟩ ↔ (𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧))
27	25, 26	bitrdi 196	. . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) ↔ (𝑥 ·R 𝑧) <R (𝑦 ·R 𝑧)))
28		ltresr 8102	. . . . 5 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
29		ltresr 8102	. . . . 5 ⊢ (⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩ ↔ 𝑦 <R 𝑥)
30	28, 29	orbi12i 772	. . . 4 ⊢ ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥))
31	30	a1i 9	. . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩) ↔ (𝑥 <R 𝑦 ∨ 𝑦 <R 𝑥)))
32	20, 27, 31	3imtr4d 203	. 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ · ⟨𝑧, 0R⟩) <ℝ (⟨𝑦, 0R⟩ · ⟨𝑧, 0R⟩) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∨ ⟨𝑦, 0R⟩ <ℝ ⟨𝑥, 0R⟩)))
33	1, 2, 3, 9, 15, 19, 32	3gencl 2838	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) <ℝ (𝐵 · 𝐶) → (𝐴 <ℝ 𝐵 ∨ 𝐵 <ℝ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 105   ∨ wo 716   ∧ w3a 1005   = wceq 1398   ∈ wcel 2202  ⟨cop 3676   class class class wbr 4093  (class class class)co 6028  Rcnr 7560  0_Rc0r 7561   ·_R cmr 7565   <_R cltr 7566  ℝcr 8074   <_ℝ cltrr 8079   · cmul 8080

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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692

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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-enq0 7687  df-nq0 7688  df-0nq0 7689  df-plq0 7690  df-mq0 7691  df-inp 7729  df-i1p 7730  df-iplp 7731  df-imp 7732  df-iltp 7733  df-enr 7989  df-nr 7990  df-plr 7991  df-mr 7992  df-ltr 7993  df-0r 7994  df-m1r 7996  df-c 8081  df-r 8085  df-mul 8087  df-lt 8088

This theorem is referenced by: (None)