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

Theorem cdlemesner 34601
Description: Part of proof of Lemma E in [Crawley] p. 113. Utility lemma. (Contributed by NM, 13-Nov-2012.)
Hypotheses
Ref Expression
cdlemesner.l = (le‘𝐾)
cdlemesner.j = (join‘𝐾)
cdlemesner.a 𝐴 = (Atoms‘𝐾)
cdlemesner.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
cdlemesner ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑆𝑅)

Proof of Theorem cdlemesner
StepHypRef Expression
1 nbrne2 4603 . . 3 ((𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑅𝑆)
213ad2ant3 1077 . 2 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑅𝑆)
32necomd 2837 1 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑆𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1031   = wceq 1475  wcel 1977  wne 2780   class class class wbr 4583  cfv 5804  (class class class)co 6549  lecple 15775  joincjn 16767  Atomscatm 33568  HLchlt 33655  LHypclh 34288
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584
This theorem is referenced by:  cdlemeda  34603
  Copyright terms: Public domain W3C validator