| 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 31491 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 39198 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) = (𝑋 ∨ 𝑌)) |
| 6 | 5 | fveq2d 6830 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = ( ⊥ ‘(𝑋 ∨ 𝑌))) |
| 7 | olop 39192 | . . . 4 ⊢ (𝐾 ∈ OL → 𝐾 ∈ OP) | |
| 8 | 7 | 3ad2ant1 1133 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) |
| 9 | ollat 39191 | . . . . 5 ⊢ (𝐾 ∈ OL → 𝐾 ∈ Lat) | |
| 10 | 9 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 11 | 1, 4 | opoccl 39172 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 7, 11 | sylan 580 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1132 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | 1, 4 | opoccl 39172 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 15 | 7, 14 | sylan 580 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 16 | 15 | 3adant2 1131 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 17 | 1, 3 | latmcl 18364 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘𝑌) ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 18 | 10, 13, 16, 17 | syl3anc 1373 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 19 | 1, 4 | opococ 39173 | . . 3 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 20 | 8, 18, 19 | syl2anc 584 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 21 | 6, 20 | eqtr3d 2766 | 1 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(𝑋 ∨ 𝑌)) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6486 (class class class)co 7353 Basecbs 17138 occoc 17187 joincjn 18235 meetcmee 18236 Latclat 18355 OPcops 39150 OLcol 39152 |
| 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 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 |
| 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 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-proset 18218 df-poset 18237 df-lub 18268 df-glb 18269 df-join 18270 df-meet 18271 df-lat 18356 df-oposet 39154 df-ol 39156 |
| This theorem is referenced by: oldmj2 39200 oldmj3 39201 cmtbr2N 39231 omlfh1N 39236 omlfh3N 39237 cvrexch 39399 poldmj1N 39907 lhpmod2i2 40017 lhpmod6i1 40018 djajN 41116 |
| Copyright terms: Public domain | W3C validator |