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

Theorem cvrcmp 36413
Description: If two lattice elements that cover a third are comparable, then they are equal. (Contributed by NM, 6-Feb-2012.)
Hypotheses
Ref Expression
cvrcmp.b 𝐵 = (Base‘𝐾)
cvrcmp.l = (le‘𝐾)
cvrcmp.c 𝐶 = ( ⋖ ‘𝐾)
Assertion
Ref Expression
cvrcmp ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → (𝑋 𝑌𝑋 = 𝑌))

Proof of Theorem cvrcmp
StepHypRef Expression
1 simpl1 1187 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝐾 ∈ Poset)
2 simpl23 1249 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑍𝐵)
3 simpl21 1247 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑋𝐵)
4 simpl3l 1224 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑍𝐶𝑋)
5 cvrcmp.b . . . . . 6 𝐵 = (Base‘𝐾)
6 cvrcmp.c . . . . . 6 𝐶 = ( ⋖ ‘𝐾)
75, 6cvrne 36411 . . . . 5 (((𝐾 ∈ Poset ∧ 𝑍𝐵𝑋𝐵) ∧ 𝑍𝐶𝑋) → 𝑍𝑋)
81, 2, 3, 4, 7syl31anc 1369 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑍𝑋)
9 cvrcmp.l . . . . . . . 8 = (le‘𝐾)
105, 9, 6cvrle 36408 . . . . . . 7 (((𝐾 ∈ Poset ∧ 𝑍𝐵𝑋𝐵) ∧ 𝑍𝐶𝑋) → 𝑍 𝑋)
111, 2, 3, 4, 10syl31anc 1369 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑍 𝑋)
12 simpr 487 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑋 𝑌)
13 simpl22 1248 . . . . . . 7 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑌𝐵)
14 simpl3r 1225 . . . . . . 7 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑍𝐶𝑌)
155, 9, 6cvrnbtwn4 36409 . . . . . . 7 ((𝐾 ∈ Poset ∧ (𝑍𝐵𝑌𝐵𝑋𝐵) ∧ 𝑍𝐶𝑌) → ((𝑍 𝑋𝑋 𝑌) ↔ (𝑍 = 𝑋𝑋 = 𝑌)))
161, 2, 13, 3, 14, 15syl131anc 1379 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → ((𝑍 𝑋𝑋 𝑌) ↔ (𝑍 = 𝑋𝑋 = 𝑌)))
1711, 12, 16mpbi2and 710 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → (𝑍 = 𝑋𝑋 = 𝑌))
18 neor 3108 . . . . 5 ((𝑍 = 𝑋𝑋 = 𝑌) ↔ (𝑍𝑋𝑋 = 𝑌))
1917, 18sylib 220 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → (𝑍𝑋𝑋 = 𝑌))
208, 19mpd 15 . . 3 (((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) ∧ 𝑋 𝑌) → 𝑋 = 𝑌)
2120ex 415 . 2 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → (𝑋 𝑌𝑋 = 𝑌))
22 simp1 1132 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → 𝐾 ∈ Poset)
23 simp21 1202 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → 𝑋𝐵)
245, 9posref 17555 . . . 4 ((𝐾 ∈ Poset ∧ 𝑋𝐵) → 𝑋 𝑋)
2522, 23, 24syl2anc 586 . . 3 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → 𝑋 𝑋)
26 breq2 5062 . . 3 (𝑋 = 𝑌 → (𝑋 𝑋𝑋 𝑌))
2725, 26syl5ibcom 247 . 2 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → (𝑋 = 𝑌𝑋 𝑌))
2821, 27impbid 214 1 ((𝐾 ∈ Poset ∧ (𝑋𝐵𝑌𝐵𝑍𝐵) ∧ (𝑍𝐶𝑋𝑍𝐶𝑌)) → (𝑋 𝑌𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wo 843  w3a 1083   = wceq 1533  wcel 2110  wne 3016   class class class wbr 5058  cfv 6349  Basecbs 16477  lecple 16566  Posetcpo 17544  ccvr 36392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fv 6357  df-proset 17532  df-poset 17550  df-plt 17562  df-covers 36396
This theorem is referenced by:  cvrcmp2  36414  atcmp  36441  llncmp  36652  lplncmp  36692  lvolcmp  36747  lhp2lt  37131
  Copyright terms: Public domain W3C validator