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 36764. 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 1187 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL) | |
2 | 1 | hllatd 36515 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat) |
3 | eqid 2821 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
4 | 4at.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
5 | 4at.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | 3, 4, 5 | hlatjcl 36518 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
7 | 6 | adantr 483 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
8 | 3, 5 | atbase 36440 | . . . 4 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾)) |
9 | 8 | ad2antrl 726 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ (Base‘𝐾)) |
10 | 3, 5 | atbase 36440 | . . . 4 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ (Base‘𝐾)) |
11 | 10 | ad2antll 727 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ (Base‘𝐾)) |
12 | 3, 4 | latjass 17705 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾))) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
13 | 2, 7, 9, 11, 12 | syl13anc 1368 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆))) |
14 | 3, 4 | latjcl 17661 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾) ∧ 𝑅 ∈ (Base‘𝐾)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
15 | 2, 7, 9, 14 | syl3anc 1367 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾)) |
16 | 3, 4 | latjcom 17669 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ ((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
17 | 2, 15, 11, 16 | syl3anc 1367 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (((𝑃 ∨ 𝑄) ∨ 𝑅) ∨ 𝑆) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
18 | 13, 17 | eqtr3d 2858 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ∨ (𝑅 ∨ 𝑆)) = (𝑆 ∨ ((𝑃 ∨ 𝑄) ∨ 𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 lecple 16572 joincjn 17554 Latclat 17655 Atomscatm 36414 HLchlt 36501 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-proset 17538 df-poset 17556 df-lub 17584 df-glb 17585 df-join 17586 df-meet 17587 df-lat 17656 df-ats 36418 df-atl 36449 df-cvlat 36473 df-hlat 36502 |
This theorem is referenced by: 4atlem9 36754 |
Copyright terms: Public domain | W3C validator |