| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > atnlej2 | 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 |
|---|---|
| atnlej2 | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hllat 40420 | . . 3 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 2 | 1 | 3ad2ant1 1151 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝐾 ∈ Lat) |
| 3 | simp21 1225 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴) | |
| 4 | eqid 2761 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 5 | atnlej.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atbase 40346 | . . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 7 | 3, 6 | syl 18 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾)) |
| 8 | simp22 1226 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴) | |
| 9 | 4, 5 | atbase 40346 | . . 3 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
| 10 | 8, 9 | syl 18 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ (Base‘𝐾)) |
| 11 | simp23 1227 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴) | |
| 12 | 4, 5 | atbase 40346 | . . 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 | latnlej1r 18632 | . 2 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑅) |
| 18 | 2, 7, 10, 13, 14, 17 | syl131anc 1410 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 lecple 17435 joincjn 18485 Latclat 18605 Atomscatm 40320 HLchlt 40407 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-lub 18518 df-join 18520 df-lat 18606 df-ats 40324 df-atl 40355 df-cvlat 40379 df-hlat 40408 |
| This theorem is used by: lplnri2N 40611 lplnri3N 40612 lplnexllnN 40621 dalem41 40770 paddasslem2 40878 4atexlemc 41126 |
| Copyright terms: Public domain | W3C validator |