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 36102
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 4806 . . 3 ((𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑅𝑆)
213ad2ant3 1129 . 2 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑅𝑆)
32necomd 2998 1 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑆𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382  w3a 1071   = wceq 1631  wcel 2145  wne 2943   class class class wbr 4786  cfv 6029  (class class class)co 6792  lecple 16152  joincjn 17148  Atomscatm 35068  HLchlt 35155  LHypclh 35789
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-br 4787
This theorem is referenced by:  cdlemeda  36104
  Copyright terms: Public domain W3C validator