Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ltltncvr Structured version   Visualization version   GIF version

Theorem ltltncvr 36992
 Description: A chained strong ordering is not a covers relation. (Contributed by NM, 18-Jun-2012.)
Hypotheses
Ref Expression
ltltncvr.b 𝐵 = (Base‘𝐾)
ltltncvr.s < = (lt‘𝐾)
ltltncvr.c 𝐶 = ( ⋖ ‘𝐾)
Assertion
Ref Expression
ltltncvr ((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 < 𝑌𝑌 < 𝑍) → ¬ 𝑋𝐶𝑍))

Proof of Theorem ltltncvr
StepHypRef Expression
1 simpll 767 . . . 4 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → 𝐾𝐴)
2 simplr1 1213 . . . 4 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → 𝑋𝐵)
3 simplr3 1215 . . . 4 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → 𝑍𝐵)
4 simplr2 1214 . . . 4 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → 𝑌𝐵)
5 simpr 489 . . . 4 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → 𝑋𝐶𝑍)
6 ltltncvr.b . . . . 5 𝐵 = (Base‘𝐾)
7 ltltncvr.s . . . . 5 < = (lt‘𝐾)
8 ltltncvr.c . . . . 5 𝐶 = ( ⋖ ‘𝐾)
96, 7, 8cvrnbtwn 36840 . . . 4 ((𝐾𝐴 ∧ (𝑋𝐵𝑍𝐵𝑌𝐵) ∧ 𝑋𝐶𝑍) → ¬ (𝑋 < 𝑌𝑌 < 𝑍))
101, 2, 3, 4, 5, 9syl131anc 1381 . . 3 (((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) ∧ 𝑋𝐶𝑍) → ¬ (𝑋 < 𝑌𝑌 < 𝑍))
1110ex 417 . 2 ((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → (𝑋𝐶𝑍 → ¬ (𝑋 < 𝑌𝑌 < 𝑍)))
1211con2d 136 1 ((𝐾𝐴 ∧ (𝑋𝐵𝑌𝐵𝑍𝐵)) → ((𝑋 < 𝑌𝑌 < 𝑍) → ¬ 𝑋𝐶𝑍))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1085   = wceq 1539   ∈ wcel 2112   class class class wbr 5033  ‘cfv 6336  Basecbs 16534  ltcplt 17610   ⋖ ccvr 36831 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pow 5235  ax-pr 5299  ax-un 7460 This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2071  df-mo 2558  df-eu 2589  df-clab 2737  df-cleq 2751  df-clel 2831  df-nfc 2902  df-ral 3076  df-rex 3077  df-rab 3080  df-v 3412  df-sbc 3698  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-nul 4227  df-if 4422  df-pw 4497  df-sn 4524  df-pr 4526  df-op 4530  df-uni 4800  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5431  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-iota 6295  df-fun 6338  df-fv 6344  df-covers 36835 This theorem is referenced by:  ltcvrntr  36993
 Copyright terms: Public domain W3C validator