Theorem axpre-lttrn 8215

Description: Ordering on reals is transitive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttrn 8257. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 16-Jun-2013.) (New usage is discouraged.)

Assertion

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

Proof of Theorem axpre-lttrn

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

Step	Hyp	Ref	Expression
1		elreal 8159	. 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2		elreal 8159	. 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3		elreal 8159	. 2 ⊢ (𝐶 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐶)
4		breq1 4117	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩))
5	4	anbi1d 465	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩)))
6		breq1 4117	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑧, 0R⟩))
7	5, 6	imbi12d 234	. 2 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
8		breq2 4118	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵))
9		breq1 4117	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ ⟨𝑧, 0R⟩))
10	8, 9	anbi12d 473	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩)))
11	10	imbi1d 231	. 2 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
12		breq2 4118	. . . 4 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ 𝐶))
13	12	anbi2d 464	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶)))
14		breq2 4118	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ 𝐶))
15	13, 14	imbi12d 234	. 2 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶)))
16		ltresr 8170	. . . . 5 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
17		ltresr 8170	. . . . 5 ⊢ (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝑦 <R 𝑧)
18		ltsosr 8095	. . . . . 6 ⊢ <R Or R
19		ltrelsr 8069	. . . . . 6 ⊢ <R ⊆ (R × R)
20	18, 19	sotri 5163	. . . . 5 ⊢ ((𝑥 <R 𝑦 ∧ 𝑦 <R 𝑧) → 𝑥 <R 𝑧)
21	16, 17, 20	syl2anb 291	. . . 4 ⊢ ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝑥 <R 𝑧)
22		ltresr 8170	. . . 4 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝑥 <R 𝑧)
23	21, 22	sylibr 134	. . 3 ⊢ ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩)
24	23	a1i 9	. 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩))
25	1, 2, 3, 7, 11, 15, 24	3gencl 2850	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1005   = wceq 1398   ∈ wcel 2205  ⟨cop 3697   class class class wbr 4114  Rcnr 7628  0_Rc0r 7629   <_R cltr 7634  ℝcr 8142   <_ℝ cltrr 8147

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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-i1p 7798  df-iplp 7799  df-iltp 7801  df-enr 8057  df-nr 8058  df-ltr 8061  df-0r 8062  df-r 8153  df-lt 8156

This theorem is referenced by: (None)