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

Theorem poltletr 6144
Description: Transitive law for general strict orders. (Contributed by Stefan O'Rear, 17-Jan-2015.)
Assertion
Ref Expression
poltletr ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶))

Proof of Theorem poltletr
StepHypRef Expression
1 poleloe 6143 . . . . 5 (𝐶 ∈ 𝑋 → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)))
213ad2ant3 1153 . . . 4 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)))
32adantl 487 . . 3 ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)))
43anbi2d 642 . 2 ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) ↔ (𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))))
5 potr 5579 . . . . 5 ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))
65com12 33 . . . 4 ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶))
7 breq2 5112 . . . . . 6 (𝐵 = 𝐶 → (𝐴𝑅𝐵 ↔ 𝐴𝑅𝐶))
87biimpac 484 . . . . 5 ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → 𝐴𝑅𝐶)
98a1d 26 . . . 4 ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶))
106, 9jaodan 972 . . 3 ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶))
1110com12 33 . 2 ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → 𝐴𝑅𝐶))
124, 11sylbid 243 1 ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ∪ cun 4152   class class class wbr 5108   I cid 5552   Po wpo 5564
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-po 5566  df-xp 5664  df-rel 5665
This theorem is used by:  soltmin  6148
  Copyright terms: Public domain W3C validator