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 11089
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 11218. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-lttrn 11113. (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 11054 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥R𝑥, 0R⟩ = 𝐴)
2 elreal 11054 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦R𝑦, 0R⟩ = 𝐵)
3 elreal 11054 . 2 (𝐶 ∈ ℝ ↔ ∃𝑧R𝑧, 0R⟩ = 𝐶)
4 breq1 5088 . . . 4 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝐴 <𝑦, 0R⟩))
54anbi1d 632 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) ↔ (𝐴 <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩)))
6 breq1 5088 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ <𝑧, 0R⟩ ↔ 𝐴 <𝑧, 0R⟩))
75, 6imbi12d 344 . 2 (⟨𝑥, 0R⟩ = 𝐴 → (((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) → ⟨𝑥, 0R⟩ <𝑧, 0R⟩) ↔ ((𝐴 <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) → 𝐴 <𝑧, 0R⟩)))
8 breq2 5089 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 <𝑦, 0R⟩ ↔ 𝐴 < 𝐵))
9 breq1 5088 . . . 4 (⟨𝑦, 0R⟩ = 𝐵 → (⟨𝑦, 0R⟩ <𝑧, 0R⟩ ↔ 𝐵 <𝑧, 0R⟩))
108, 9anbi12d 633 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) ↔ (𝐴 < 𝐵𝐵 <𝑧, 0R⟩)))
1110imbi1d 341 . 2 (⟨𝑦, 0R⟩ = 𝐵 → (((𝐴 <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) → 𝐴 <𝑧, 0R⟩) ↔ ((𝐴 < 𝐵𝐵 <𝑧, 0R⟩) → 𝐴 <𝑧, 0R⟩)))
12 breq2 5089 . . . 4 (⟨𝑧, 0R⟩ = 𝐶 → (𝐵 <𝑧, 0R⟩ ↔ 𝐵 < 𝐶))
1312anbi2d 631 . . 3 (⟨𝑧, 0R⟩ = 𝐶 → ((𝐴 < 𝐵𝐵 <𝑧, 0R⟩) ↔ (𝐴 < 𝐵𝐵 < 𝐶)))
14 breq2 5089 . . 3 (⟨𝑧, 0R⟩ = 𝐶 → (𝐴 <𝑧, 0R⟩ ↔ 𝐴 < 𝐶))
1513, 14imbi12d 344 . 2 (⟨𝑧, 0R⟩ = 𝐶 → (((𝐴 < 𝐵𝐵 <𝑧, 0R⟩) → 𝐴 <𝑧, 0R⟩) ↔ ((𝐴 < 𝐵𝐵 < 𝐶) → 𝐴 < 𝐶)))
16 ltresr 11063 . . . . 5 (⟨𝑥, 0R⟩ <𝑦, 0R⟩ ↔ 𝑥 <R 𝑦)
17 ltresr 11063 . . . . 5 (⟨𝑦, 0R⟩ <𝑧, 0R⟩ ↔ 𝑦 <R 𝑧)
18 ltsosr 11017 . . . . . 6 <R Or R
19 ltrelsr 10991 . . . . . 6 <R ⊆ (R × R)
2018, 19sotri 6090 . . . . 5 ((𝑥 <R 𝑦𝑦 <R 𝑧) → 𝑥 <R 𝑧)
2116, 17, 20syl2anb 599 . . . 4 ((⟨𝑥, 0R⟩ <𝑦, 0R⟩ ∧ ⟨𝑦, 0R⟩ <𝑧, 0R⟩) → 𝑥 <R 𝑧)
22 ltresr 11063 . . . 4 (⟨𝑥, 0R⟩ <𝑧, 0R⟩ ↔ 𝑥 <R 𝑧)
2321, 22sylibr 234 . . 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 3473 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < 𝐵𝐵 < 𝐶) → 𝐴 < 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  cop 4573   class class class wbr 5085  Rcnr 10788  0Rc0r 10789   <R cltr 10794  cr 11037   < cltrr 11042
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-omul 8410  df-er 8643  df-ec 8645  df-qs 8649  df-ni 10795  df-pli 10796  df-mi 10797  df-lti 10798  df-plpq 10831  df-mpq 10832  df-ltpq 10833  df-enq 10834  df-nq 10835  df-erq 10836  df-plq 10837  df-mq 10838  df-1nq 10839  df-rq 10840  df-ltnq 10841  df-np 10904  df-1p 10905  df-plp 10906  df-ltp 10908  df-enr 10978  df-nr 10979  df-ltr 10982  df-0r 10983  df-r 11048  df-lt 11051
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator