MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axpre-lttrn Structured version   Visualization version   GIF version

Theorem axpre-lttrn 11244
Description: Ordering on reals is transitive. Axiom 19 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version for extended reals is axlttrn 11375. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttrn 11268. (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.
StepHypRef Expression
1 elreal 11209 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R ⟨𝑥, 0R⟩ = 𝐴)
2 elreal 11209 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R ⟨𝑦, 0R⟩ = 𝐵)
3 elreal 11209 . 2 (𝐶 ∈ ℝ ↔ ∃𝑧 ∈ R ⟨𝑧, 0R⟩ = 𝐶)
4 breq1 5106 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑦, 0R⟩))
54anbi1d 643 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩)))
6 breq1 5106 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ ⟨𝑧, 0R⟩))
75, 6imbi12d 347 . 2 (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
8 breq2 5107 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <ℝ ⟨𝑦, 0R⟩ ↔ 𝐴 <ℝ 𝐵))
9 breq1 5106 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ ⟨𝑧, 0R⟩))
108, 9anbi12d 644 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩)))
1110imbi1d 344 . 2 (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩)))
12 breq2 5107 . . . 4 (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐵 <ℝ 𝐶))
1312anbi2d 642 . . 3 (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) ↔ (𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶)))
14 breq2 5107 . . 3 (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 <ℝ ⟨𝑧, 0R⟩ ↔ 𝐴 <ℝ 𝐶))
1513, 14imbi12d 347 . 2 (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ ⟨𝑧, 0R⟩) → 𝐴 <ℝ ⟨𝑧, 0R⟩) ↔ ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶)))
16 ltresr 11218 . . . . 5 (⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
17 ltresr 11218 . . . . 5 (⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝑦 <R 𝑧)
18 ltsosr 11172 . . . . . 6 <R Or R
19 ltrelsr 11146 . . . . . 6 <R ⊆ (R × R)
2018, 19sotri 6121 . . . . 5 ((𝑥 <R 𝑦 ∧ 𝑦 <R 𝑧) → 𝑥 <R 𝑧)
2116, 17, 20syl2anb 610 . . . 4 ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → 𝑥 <R 𝑧)
22 ltresr 11218 . . . 4 (⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩ ↔ 𝑥 <R 𝑧)
2321, 22sylibr 237 . . 3 ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩)
2423a1i 11 . 2 ((𝑥 ∈ R ∧ 𝑦 ∈ R ∧ 𝑧 ∈ R) → ((⟨𝑥, 0R⟩ <ℝ ⟨𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <ℝ ⟨𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <ℝ ⟨𝑧, 0R⟩))
251, 2, 3, 7, 11, 15, 243gencl 3494 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 <ℝ 𝐵 ∧ 𝐵 <ℝ 𝐶) → 𝐴 <ℝ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   class class class wbr 5103  Rcnr 10943  0Rc0r 10944   <R cltr 10949  ℝcr 11192   <ℝ cltrr 11197
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-oadd 8473  df-omul 8474  df-er 8710  df-ec 8712  df-qs 8716  df-ni 10950  df-pli 10951  df-mi 10952  df-lti 10953  df-plpq 10986  df-mpq 10987  df-ltpq 10988  df-enq 10989  df-nq 10990  df-erq 10991  df-plq 10992  df-mq 10993  df-1nq 10994  df-rq 10995  df-ltnq 10996  df-np 11059  df-1p 11060  df-plp 11061  df-ltp 11063  df-enr 11133  df-nr 11134  df-ltr 11137  df-0r 11138  df-r 11203  df-lt 11206
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator