| 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 39768 | . . 3 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 2 | 1 | 3ad2ant1 1134 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝐾 ∈ Lat) |
| 3 | simp21 1208 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ 𝐴) | |
| 4 | eqid 2737 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 5 | atnlej.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 4, 5 | atbase 39694 | . . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 7 | 3, 6 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ∈ (Base‘𝐾)) |
| 8 | simp22 1209 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ 𝐴) | |
| 9 | 4, 5 | atbase 39694 | . . 3 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
| 10 | 8, 9 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑄 ∈ (Base‘𝐾)) |
| 11 | simp23 1210 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ 𝐴) | |
| 12 | 4, 5 | atbase 39694 | . . 3 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾)) |
| 13 | 11, 12 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑅 ∈ (Base‘𝐾)) |
| 14 | simp3 1139 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) | |
| 15 | atnlej.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 16 | atnlej.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 17 | 4, 15, 16 | latnlej1l 18394 | . 2 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄) |
| 18 | 2, 7, 10, 13, 14, 17 | syl131anc 1386 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑃 ≤ (𝑄 ∨ 𝑅)) → 𝑃 ≠ 𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 class class class wbr 5100 ‘cfv 6502 (class class class)co 7370 Basecbs 17150 lecple 17198 joincjn 18248 Latclat 18368 Atomscatm 39668 HLchlt 39755 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-lub 18281 df-join 18283 df-lat 18369 df-ats 39672 df-atl 39703 df-cvlat 39727 df-hlat 39756 |
| This theorem is referenced by: 4atlem0be 40000 dalem5 40072 dalem-cly 40076 4atexlemex6 40479 cdleme00a 40614 cdleme21a 40730 cdleme21b 40731 cdleme21c 40732 |
| Copyright terms: Public domain | W3C validator |