Theorem axpre-ltadd 11207

Description: Ordering property of addition on reals. Axiom 20 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version for extended reals is axltadd 11334. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-ltadd 11231. (Contributed by NM, 11-May-1996.) (New usage is discouraged.)

Assertion

Ref	Expression
axpre-ltadd	⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 → (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵)))

Proof of Theorem axpre-ltadd

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elreal 11171	. . 3 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2		elreal 11171	. . 3 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3		elreal 11171	. . 3 ⊢ (𝐶 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐶)
4		breq1 5146	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩))
5		oveq2 7439	. . . . 5 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) = (⟨𝑧, 0R⟩ + 𝐴))
6	5	breq1d 5153	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)))
7	4, 6	bibi12d 345	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩))))
8		breq2 5147	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵))
9		oveq2 7439	. . . . 5 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) = (⟨𝑧, 0R⟩ + 𝐵))
10	9	breq2d 5155	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + 𝐵)))
11	8, 10	bibi12d 345	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)) ↔ (𝐴 <ℝ 𝐵 ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + 𝐵))))
12		oveq1 7438	. . . . 5 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (⟨𝑧, 0R⟩ + 𝐴) = (𝐶 + 𝐴))
13		oveq1 7438	. . . . 5 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (⟨𝑧, 0R⟩ + 𝐵) = (𝐶 + 𝐵))
14	12, 13	breq12d 5156	. . . 4 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → ((⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵)))
15	14	bibi2d 342	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 <ℝ 𝐵 ↔ (⟨𝑧, 0R⟩ + 𝐴) <ℝ (⟨𝑧, 0R⟩ + 𝐵)) ↔ (𝐴 <ℝ 𝐵 ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))))
16		ltasr 11140	. . . . . . 7 ⊢ (𝑧 ∈ R → (𝑥 <R 𝑦 ↔ (𝑧 +R 𝑥) <R (𝑧 +R 𝑦)))
17	16	adantr 480	. . . . . 6 ⊢ ((𝑧 ∈ R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (𝑥 <R 𝑦 ↔ (𝑧 +R 𝑥) <R (𝑧 +R 𝑦)))
18		ltresr 11180	. . . . . . 7 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
19	18	a1i 11	. . . . . 6 ⊢ ((𝑧 ∈ R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦))
20		addresr 11178	. . . . . . . . 9 ⊢ ((𝑧 ∈ R ∧ 𝑥 ∈ R) → (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) = ⟨(𝑧 +R 𝑥), 0R⟩)
21		addresr 11178	. . . . . . . . 9 ⊢ ((𝑧 ∈ R ∧ 𝑦 ∈ R) → (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) = ⟨(𝑧 +R 𝑦), 0R⟩)
22	20, 21	breqan12d 5159	. . . . . . . 8 ⊢ (((𝑧 ∈ R ∧ 𝑥 ∈ R) ∧ (𝑧 ∈ R ∧ 𝑦 ∈ R)) → ((⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) ↔ ⟨(𝑧 +R 𝑥), 0R⟩ <ℝ ⟨(𝑧 +R 𝑦), 0R⟩))
23	22	anandis 678	. . . . . . 7 ⊢ ((𝑧 ∈ R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → ((⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) ↔ ⟨(𝑧 +R 𝑥), 0R⟩ <ℝ ⟨(𝑧 +R 𝑦), 0R⟩))
24		ltresr 11180	. . . . . . 7 ⊢ (⟨(𝑧 +R 𝑥), 0R⟩ <ℝ ⟨(𝑧 +R 𝑦), 0R⟩ ↔ (𝑧 +R 𝑥) <R (𝑧 +R 𝑦))
25	23, 24	bitrdi 287	. . . . . 6 ⊢ ((𝑧 ∈ R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → ((⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩) ↔ (𝑧 +R 𝑥) <R (𝑧 +R 𝑦)))
26	17, 19, 25	3bitr4d 311	. . . . 5 ⊢ ((𝑧 ∈ R ∧ (𝑥 ∈ R ∧ 𝑦 ∈ R)) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)))
27	26	ancoms 458	. . . 4 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ 𝑧 ∈ R) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)))
28	27	3impa 1110	. . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ (⟨𝑧, 0R⟩ + ⟨𝑥, 0R⟩) <ℝ (⟨𝑧, 0R⟩ + ⟨𝑦, 0R⟩)))
29	1, 2, 3, 7, 11, 15, 28	3gencl 3525	. 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵)))
30	29	biimpd 229	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 → (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108  ⟨cop 4632   class class class wbr 5143  (class class class)co 7431  Rcnr 10905  0_Rc0r 10906   +_R cplr 10909   <_R cltr 10911  ℝcr 11154   + caddc 11158   <_ℝ cltrr 11159

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-inf2 9681

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-oadd 8510  df-omul 8511  df-er 8745  df-ec 8747  df-qs 8751  df-ni 10912  df-pli 10913  df-mi 10914  df-lti 10915  df-plpq 10948  df-mpq 10949  df-ltpq 10950  df-enq 10951  df-nq 10952  df-erq 10953  df-plq 10954  df-mq 10955  df-1nq 10956  df-rq 10957  df-ltnq 10958  df-np 11021  df-1p 11022  df-plp 11023  df-ltp 11025  df-enr 11095  df-nr 11096  df-plr 11097  df-ltr 11099  df-0r 11100  df-c 11161  df-r 11165  df-add 11166  df-lt 11168

This theorem is referenced by: (None)