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 37312
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 5077 . . 3 ((𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝑅𝑆)
213ad2ant3 1127 . 2 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑅𝑆)
32necomd 3068 1 ((𝐾 ∈ HL ∧ (𝑅𝐴𝑆𝐴) ∧ (𝑅 (𝑃 𝑄) ∧ ¬ 𝑆 (𝑃 𝑄))) → 𝑆𝑅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1079   = wceq 1528  wcel 2105  wne 3013   class class class wbr 5057  cfv 6348  (class class class)co 7145  lecple 16560  joincjn 17542  Atomscatm 36279  HLchlt 36366  LHypclh 37000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-rab 3144  df-v 3494  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-br 5058
This theorem is referenced by:  cdlemeda  37314
  Copyright terms: Public domain W3C validator