| 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 32018 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 40101 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) = (𝑋 ∨ 𝑌)) |
| 6 | 5 | fveq2d 6886 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = ( ⊥ ‘(𝑋 ∨ 𝑌))) |
| 7 | olop 40095 | . . . 4 ⊢ (𝐾 ∈ OL → 𝐾 ∈ OP) | |
| 8 | 7 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) |
| 9 | ollat 40094 | . . . . 5 ⊢ (𝐾 ∈ OL → 𝐾 ∈ Lat) | |
| 10 | 9 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 11 | 1, 4 | opoccl 40075 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 7, 11 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1150 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | 1, 4 | opoccl 40075 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 15 | 7, 14 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 16 | 15 | 3adant2 1149 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 17 | 1, 3 | latmcl 18534 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘𝑌) ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 18 | 10, 13, 16, 17 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 19 | 1, 4 | opococ 40076 | . . 3 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 20 | 8, 18, 19 | syl2anc 596 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 21 | 6, 20 | eqtr3d 2799 | 1 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(𝑋 ∨ 𝑌)) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 occoc 17356 joincjn 18405 meetcmee 18406 Latclat 18525 OPcops 40053 OLcol 40055 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-proset 18388 df-poset 18407 df-lub 18438 df-glb 18439 df-join 18440 df-meet 18441 df-lat 18526 df-oposet 40057 df-ol 40059 |
| This theorem is used by: oldmj2 40103 oldmj3 40104 cmtbr2N 40134 omlfh1N 40139 omlfh3N 40140 cvrexch 40301 poldmj1N 40809 lhpmod2i2 40919 lhpmod6i1 40920 djajN 42018 |
| Copyright terms: Public domain | W3C validator |