| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 4atlem4d | Structured version Visualization version GIF version | ||
| Description: Lemma for 4at 40407. Frequently used associative law. (Contributed by NM, 9-Jul-2012.) |
| Ref | Expression |
|---|---|
| 4at.l | ⊢ ≤ = (le‘𝐾) |
| 4at.j | ⊢ ∨ = (join‘𝐾) |
| 4at.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| 4atlem4d | ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆)) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1210 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL) | |
| 2 | 1 | hllatd 40158 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat) |
| 3 | eqid 2763 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | 4at.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 5 | 4at.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 3, 4, 5 | hlatjcl 40161 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 7 | 6 | adantr 485 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 8 | 3, 5 | atbase 40083 | . . . 4 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾)) |
| 9 | 8 | ad2antrl 740 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ (Base‘𝐾)) |
| 10 | 3, 5 | atbase 40083 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ (Base‘𝐾)) |
| 11 | 10 | ad2antll 741 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ (Base‘𝐾)) |
| 12 | 3, 4 | latjass 18534 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾))) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
| 13 | 2, 7, 9, 11, 12 | syl13anc 1399 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
| 14 | 3, 4 | latjcl 18490 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
| 15 | 2, 7, 9, 14 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
| 16 | 3, 4 | latjcom 18498 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| 17 | 2, 15, 11, 16 | syl3anc 1398 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| 18 | 13, 17 | eqtr3d 2800 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆)) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ‘cfv 6536 (class class class)co 7410 Basecbs 17264 lecple 17312 joincjn 18362 Latclat 18482 Atomscatm 40057 HLchlt 40144 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-proset 18345 df-poset 18364 df-lub 18395 df-glb 18396 df-join 18397 df-meet 18398 df-lat 18483 df-ats 40061 df-atl 40092 df-cvlat 40116 df-hlat 40145 |
| This theorem is referenced by: 4atlem9 40397 |
| Copyright terms: Public domain | W3C validator |