Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > atnlej1 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
atnlej.l | ⊢ ≤ = (le‘𝐾) |
atnlej.j | ⊢ ∨ = (join‘𝐾) |
atnlej.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
atnlej1 | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hllat 36965 | . . 3 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
2 | 1 | 3ad2ant1 1130 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝐾 ∈ Lat) |
3 | simp21 1203 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴) | |
4 | eqid 2758 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
5 | atnlej.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | 4, 5 | atbase 36891 | . . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
7 | 3, 6 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾)) |
8 | simp22 1204 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴) | |
9 | 4, 5 | atbase 36891 | . . 3 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ (Base‘𝐾)) |
11 | simp23 1205 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴) | |
12 | 4, 5 | atbase 36891 | . . 3 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾)) |
13 | 11, 12 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ (Base‘𝐾)) |
14 | simp3 1135 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) | |
15 | atnlej.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
16 | atnlej.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
17 | 4, 15, 16 | latnlej1l 17750 | . 2 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄) |
18 | 2, 7, 10, 13, 14, 17 | syl131anc 1380 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2951 class class class wbr 5035 ‘cfv 6339 (class class class)co 7155 Basecbs 16546 lecple 16635 joincjn 17625 Latclat 17726 Atomscatm 36865 HLchlt 36952 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-rep 5159 ax-sep 5172 ax-nul 5179 ax-pow 5237 ax-pr 5301 ax-un 7464 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-reu 3077 df-rab 3079 df-v 3411 df-sbc 3699 df-csb 3808 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4802 df-iun 4888 df-br 5036 df-opab 5098 df-mpt 5116 df-id 5433 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-rn 5538 df-res 5539 df-ima 5540 df-iota 6298 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-riota 7113 df-ov 7158 df-oprab 7159 df-lub 17655 df-join 17657 df-lat 17727 df-ats 36869 df-atl 36900 df-cvlat 36924 df-hlat 36953 |
This theorem is referenced by: 4atlem0be 37197 dalem5 37269 dalem-cly 37273 4atexlemex6 37676 cdleme00a 37811 cdleme21a 37927 cdleme21b 37928 cdleme21c 37929 |
Copyright terms: Public domain | W3C validator |