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 40543
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 1210 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝐾 ∈ Poset)
2 simpl23 1272 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑍 ∈ 𝐵)
3 simpl21 1270 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑋 ∈ 𝐵)
4 simpl3l 1247 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑍𝐶𝑋)
5 cvrcmp.b . . . . . 6 𝐵 = (Base‘𝐾)
6 cvrcmp.c . . . . . 6 𝐶 = ( ⋖ ‘𝐾)
75, 6cvrne 40541 . . . . 5 (((𝐾 ∈ Poset ∧ 𝑍 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑍𝐶𝑋) → 𝑍 ≠ 𝑋)
81, 2, 3, 4, 7syl31anc 1401 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑍 ≠ 𝑋)
9 cvrcmp.l . . . . . . . 8 ≤ = (le‘𝐾)
105, 9, 6cvrle 40538 . . . . . . 7 (((𝐾 ∈ Poset ∧ 𝑍 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑍𝐶𝑋) → 𝑍 ≤ 𝑋)
111, 2, 3, 4, 10syl31anc 1401 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑍 ≤ 𝑋)
12 simpr 490 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑋 ≤ 𝑌)
13 simpl22 1271 . . . . . . 7 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑌 ∈ 𝐵)
14 simpl3r 1248 . . . . . . 7 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑍𝐶𝑌)
155, 9, 6cvrnbtwn4 40539 . . . . . . 7 ((𝐾 ∈ Poset ∧ (𝑍 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑍𝐶𝑌) → ((𝑍 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ (𝑍 = 𝑋 ∨ 𝑋 = 𝑌)))
161, 2, 13, 3, 14, 15syl131anc 1411 . . . . . 6 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → ((𝑍 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) ↔ (𝑍 = 𝑋 ∨ 𝑋 = 𝑌)))
1711, 12, 16mpbi2and 725 . . . . 5 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → (𝑍 = 𝑋 ∨ 𝑋 = 𝑌))
18 neor 3051 . . . . 5 ((𝑍 = 𝑋 ∨ 𝑋 = 𝑌) ↔ (𝑍 ≠ 𝑋 → 𝑋 = 𝑌))
1917, 18sylib 221 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → (𝑍 ≠ 𝑋 → 𝑋 = 𝑌))
208, 19mpd 16 . . 3 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) ∧ 𝑋 ≤ 𝑌) → 𝑋 = 𝑌)
2120ex 418 . 2 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → (𝑋 ≤ 𝑌 → 𝑋 = 𝑌))
22 simp1 1154 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → 𝐾 ∈ Poset)
23 simp21 1225 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → 𝑋 ∈ 𝐵)
245, 9posref 18524 . . . 4 ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋)
2522, 23, 24syl2anc 596 . . 3 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → 𝑋 ≤ 𝑋)
26 breq2 5110 . . 3 (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌))
2725, 26syl5ibcom 248 . 2 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌))
2821, 27impbid 215 1 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) ∧ (𝑍𝐶𝑋 ∧ 𝑍𝐶𝑌)) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))
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   ≠ wne 2959   class class class wbr 5106  ‘cfv 6561  Basecbs 17419  lecple 17467  Posetcpo 18513   ⋖ ccvr 40522
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-proset 18500  df-poset 18519  df-plt 18534  df-covers 40526
This theorem is used by:  cvrcmp2  40544  atcmp  40571  llncmp  40782  lplncmp  40822  lvolcmp  40877  lhp2lt  41261
  Copyright terms: Public domain W3C validator