| 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 39596. 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 1192 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL) | |
| 2 | 1 | hllatd 39347 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat) |
| 3 | eqid 2729 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | 4at.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 5 | 4at.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 3, 4, 5 | hlatjcl 39350 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 7 | 6 | adantr 480 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 8 | 3, 5 | atbase 39272 | . . . 4 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾)) |
| 9 | 8 | ad2antrl 728 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ (Base‘𝐾)) |
| 10 | 3, 5 | atbase 39272 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ (Base‘𝐾)) |
| 11 | 10 | ad2antll 729 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ (Base‘𝐾)) |
| 12 | 3, 4 | latjass 18389 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾))) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
| 13 | 2, 7, 9, 11, 12 | syl13anc 1374 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
| 14 | 3, 4 | latjcl 18345 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
| 15 | 2, 7, 9, 14 | syl3anc 1373 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
| 16 | 3, 4 | latjcom 18353 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| 17 | 2, 15, 11, 16 | syl3anc 1373 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| 18 | 13, 17 | eqtr3d 2766 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆)) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6482 (class class class)co 7349 Basecbs 17120 lecple 17168 joincjn 18217 Latclat 18337 Atomscatm 39246 HLchlt 39333 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-proset 18200 df-poset 18219 df-lub 18250 df-glb 18251 df-join 18252 df-meet 18253 df-lat 18338 df-ats 39250 df-atl 39281 df-cvlat 39305 df-hlat 39334 |
| This theorem is referenced by: 4atlem9 39586 |
| Copyright terms: Public domain | W3C validator |