| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > oldmj1 | Structured version Visualization version GIF version | ||
| Description: De Morgan's law for join in an ortholattice. (chdmj1 32136 analog.) (Contributed by NM, 6-Nov-2011.) |
| Ref | Expression |
|---|---|
| oldmm1.b | ⊢ 𝐵 = (Base‘𝐾) |
| oldmm1.j | ⊢ ∨ = (join‘𝐾) |
| oldmm1.m | ⊢ ∧ = (meet‘𝐾) |
| oldmm1.o | ⊢ ⊥ = (oc‘𝐾) |
| Ref | Expression |
|---|---|
| oldmj1 | ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(𝑋 ∨ 𝑌)) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oldmm1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | oldmm1.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 3 | oldmm1.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 4 | oldmm1.o | . . . 4 ⊢ ⊥ = (oc‘𝐾) | |
| 5 | 1, 2, 3, 4 | oldmm4 40370 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) = (𝑋 ∨ 𝑌)) |
| 6 | 5 | fveq2d 6889 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = ( ⊥ ‘(𝑋 ∨ 𝑌))) |
| 7 | olop 40364 | . . . 4 ⊢ (𝐾 ∈ OL → 𝐾 ∈ OP) | |
| 8 | 7 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) |
| 9 | ollat 40363 | . . . . 5 ⊢ (𝐾 ∈ OL → 𝐾 ∈ Lat) | |
| 10 | 9 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 11 | 1, 4 | opoccl 40344 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 7, 11 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1150 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | 1, 4 | opoccl 40344 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 15 | 7, 14 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 16 | 15 | 3adant2 1149 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 17 | 1, 3 | latmcl 18619 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘𝑌) ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 18 | 10, 13, 16, 17 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 19 | 1, 4 | opococ 40345 | . . 3 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 20 | 8, 18, 19 | syl2anc 596 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 21 | 6, 20 | eqtr3d 2797 | 1 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(𝑋 ∨ 𝑌)) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ‘cfv 6538 (class class class)co 7420 Basecbs 17392 occoc 17441 joincjn 18490 meetcmee 18491 Latclat 18610 OPcops 40322 OLcol 40324 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-proset 18473 df-poset 18492 df-lub 18523 df-glb 18524 df-join 18525 df-meet 18526 df-lat 18611 df-oposet 40326 df-ol 40328 |
| This theorem is used by: oldmj2 40372 oldmj3 40373 cmtbr2N 40403 omlfh1N 40408 omlfh3N 40409 cvrexch 40570 poldmj1N 41078 lhpmod2i2 41188 lhpmod6i1 41189 djajN 42287 |
| Copyright terms: Public domain | W3C validator |