Theorem atnlej1 40627

Description: If an atom is not less than or equal to the join of two others, it is not equal to either. (This also holds for non-atoms, but in this form it is convenient.) (Contributed by NM, 8-Jan-2012.)

Hypotheses

Ref	Expression
atnlej.l	⊢ ≤ = (le‘𝐾)
atnlej.j	⊢ ∨ = (join‘𝐾)
atnlej.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
atnlej1	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄)

Proof of Theorem atnlej1

Step	Hyp	Ref	Expression
1		hllat 40611	. . 3 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
2	1	3ad2ant1 1151	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝐾 ∈ Lat)
3		simp21 1225	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴)
4		eqid 2763	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
5		atnlej.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 40537	. . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
7	3, 6	syl 18	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾))
8		simp22 1226	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴)
9	4, 5	atbase 40537	. . 3 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
10	8, 9	syl 18	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ (Base‘𝐾))
11		simp23 1227	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴)
12	4, 5	atbase 40537	. . 3 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
13	11, 12	syl 18	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ (Base‘𝐾))
14		simp3 1156	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → ¬ 𝑃 ≤ (𝑄 ∨ 𝑅))
15		atnlej.l	. . 3 ⊢ ≤ = (le‘𝐾)
16		atnlej.j	. . 3 ⊢ ∨ = (join‘𝐾)
17	4, 15, 16	latnlej1l 18657	. 2 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄)
18	2, 7, 10, 13, 14, 17	syl131anc 1411	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  Latclat 18631  Atomscatm 40511  HLchlt 40598

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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-lub 18544  df-join 18546  df-lat 18632  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599

This theorem is used by:  4atlem0be  40843  dalem5  40915  dalem-cly  40919  4atexlemex6  41322  cdleme00a  41457  cdleme21a  41573  cdleme21b  41574  cdleme21c  41575