| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 2atmat0 | Structured version Visualization version GIF version | ||
| Description: The meet of two unequal lines (expressed as joins of atoms) is an atom or zero. (Contributed by NM, 2-Dec-2012.) |
| Ref | Expression |
|---|---|
| 2atmatz.j | ⊢ ∨ = (join‘𝐾) |
| 2atmatz.m | ⊢ ∧ = (meet‘𝐾) |
| 2atmatz.z | ⊢ 0 = (0.‘𝐾) |
| 2atmatz.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| 2atmat0 | ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) | |
| 2 | simpr1 1213 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → 𝑅 ∈ 𝐴) | |
| 3 | simpr2 1214 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → 𝑆 ∈ 𝐴) | |
| 4 | 3 | orcd 887 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (𝑆 ∈ 𝐴 ∨ 𝑆 = 0 )) |
| 5 | simpr3 1215 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆)) | |
| 6 | 2atmatz.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 7 | 2atmatz.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 8 | 2atmatz.z | . . 3 ⊢ 0 = (0.‘𝐾) | |
| 9 | 2atmatz.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | 6, 7, 8, 9 | 2at0mat0 40359 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∨ 𝑆 = 0 ) ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) = 0 )) |
| 11 | 1, 2, 4, 5, 10 | syl13anc 1399 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ (𝑃 ∨ 𝑄) ≠ (𝑅 ∨ 𝑆))) → (((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑄) ∧ (𝑅 ∨ 𝑆)) = 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ‘cfv 6540 (class class class)co 7419 joincjn 18391 meetcmee 18392 0.cp0 18501 Atomscatm 40097 HLchlt 40184 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-proset 18374 df-poset 18393 df-plt 18408 df-lub 18424 df-glb 18425 df-join 18426 df-meet 18427 df-p0 18503 df-lat 18512 df-clat 18579 df-oposet 40010 df-ol 40012 df-oml 40013 df-covers 40100 df-ats 40101 df-atl 40132 df-cvlat 40156 df-hlat 40185 df-llines 40332 |
| This theorem is used by: 2atm 40361 trlval3 41021 cdleme22b 41175 cdlemg31b0N 41528 cdlemh 41651 |
| Copyright terms: Public domain | W3C validator |