Theorem cdlemesner 40285

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

Step	Hyp	Ref	Expression
1		nbrne2 5129	. . 3 ⊢ ((𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ≠ 𝑆)
2	1	3ad2ant3 1135	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑅 ≠ 𝑆)
3	2	necomd 2981	1 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ≠ 𝑅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2926   class class class wbr 5109  ‘cfv 6513  (class class class)co 7389  lecple 17233  joincjn 18278  Atomscatm 39251  HLchlt 39338  LHypclh 39973

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-rab 3409  df-v 3452  df-dif 3919  df-un 3921  df-ss 3933  df-nul 4299  df-if 4491  df-sn 4592  df-pr 4594  df-op 4598  df-br 5110

This theorem is referenced by:  cdlemeda  40287