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

Theorem cvrletrN 40533
Description: Property of an element above a covering. (Contributed by NM, 7-Dec-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
cvrletr.b 𝐵 = (Base‘𝐾)
cvrletr.l ≤ = (le‘𝐾)
cvrletr.s < = (lt‘𝐾)
cvrletr.c 𝐶 = ( ⋖ ‘𝐾)
Assertion
Ref Expression
cvrletrN ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋𝐶𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍))

Proof of Theorem cvrletrN
StepHypRef Expression
1 simpll 779 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → 𝐾 ∈ Poset)
2 simplr1 1234 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → 𝑋 ∈ 𝐵)
3 simplr2 1235 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → 𝑌 ∈ 𝐵)
4 simpr 490 . . . 4 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → 𝑋𝐶𝑌)
5 cvrletr.b . . . . 5 𝐵 = (Base‘𝐾)
6 cvrletr.s . . . . 5 < = (lt‘𝐾)
7 cvrletr.c . . . . 5 𝐶 = ( ⋖ ‘𝐾)
85, 6, 7cvrlt 40530 . . . 4 (((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋𝐶𝑌) → 𝑋 < 𝑌)
91, 2, 3, 4, 8syl31anc 1401 . . 3 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → 𝑋 < 𝑌)
10 cvrletr.l . . . . 5 ≤ = (le‘𝐾)
115, 10, 6pltletr 18547 . . . 4 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍))
1211adantr 486 . . 3 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → ((𝑋 < 𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍))
139, 12mpand 708 . 2 (((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) ∧ 𝑋𝐶𝑌) → (𝑌 ≤ 𝑍 → 𝑋 < 𝑍))
1413expimpd 459 1 ((𝐾 ∈ Poset ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋𝐶𝑌 ∧ 𝑌 ≤ 𝑍) → 𝑋 < 𝑍))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  ‘cfv 6561  Basecbs 17419  lecple 17467  Posetcpo 18513  ltcplt 18514   ⋖ 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: (None)
  Copyright terms: Public domain W3C validator