Theorem axpre-lttrn 8257

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 8299. (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 8201	. 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2		elreal 8201	. 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3		elreal 8201	. 2 ⊢ (𝐶 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐶)
4		breq1 4134	. . . 4 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩))
5	4	anbi1d 469	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩)))
6		breq1 4134	. . 3 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑧, 0R⟩))
7	5, 6	imbi12d 234	. 2 ⊢ (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
8		breq2 4135	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵))
9		breq1 4134	. . . 4 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ ⟨𝑧, 0R⟩))
10	8, 9	anbi12d 477	. . 3 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩)))
11	10	imbi1d 231	. 2 ⊢ (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
12		breq2 4135	. . . 4 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ 𝐶))
13	12	anbi2d 468	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶)))
14		breq2 4135	. . 3 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ 𝐶))
15	13, 14	imbi12d 234	. 2 ⊢ (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶)))
16		ltresr 8212	. . . . 5 ⊢ (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
17		ltresr 8212	. . . . 5 ⊢ (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝑦 <R 𝑧)
18		ltsosr 8137	. . . . . 6 ⊢ <R Or R
19		ltrelsr 8111	. . . . . 6 ⊢ <R ⊆ (R × R)
20	18, 19	sotri 5186	. . . . 5 ⊢ ((𝑥 <R 𝑦 ∧ 𝑦 <R 𝑧) → 𝑥 <R 𝑧)
21	16, 17, 20	syl2anb 291	. . . 4 ⊢ ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝑥 <R 𝑧)
22		ltresr 8212	. . . 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 2856	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ⟨cop 3712   class class class wbr 4131  Rcnr 7670  0_Rc0r 7671   <_R cltr 7676  ℝcr 8184   <_ℝ cltrr 8189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-enq0 7797  df-nq0 7798  df-0nq0 7799  df-plq0 7800  df-mq0 7801  df-inp 7839  df-i1p 7840  df-iplp 7841  df-iltp 7843  df-enr 8099  df-nr 8100  df-ltr 8103  df-0r 8104  df-r 8195  df-lt 8198

This theorem is used by: (None)