| 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 32161 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 40469 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) = (𝑋 ∨ 𝑌)) |
| 6 | 5 | fveq2d 6912 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = ( ⊥ ‘(𝑋 ∨ 𝑌))) |
| 7 | olop 40463 | . . . 4 ⊢ (𝐾 ∈ OL → 𝐾 ∈ OP) | |
| 8 | 7 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) |
| 9 | ollat 40462 | . . . . 5 ⊢ (𝐾 ∈ OL → 𝐾 ∈ Lat) | |
| 10 | 9 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) |
| 11 | 1, 4 | opoccl 40443 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 12 | 7, 11 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 13 | 12 | 3adant3 1150 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 14 | 1, 4 | opoccl 40443 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 15 | 7, 14 | sylan 592 | . . . . 5 ⊢ ((𝐾 ∈ OL ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 16 | 15 | 3adant2 1149 | . . . 4 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 17 | 1, 3 | latmcl 18643 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘𝑌) ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 18 | 10, 13, 16, 17 | syl3anc 1399 | . . 3 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) |
| 19 | 1, 4 | opococ 40444 | . . 3 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)) ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 20 | 8, 18, 19 | syl2anc 596 | . 2 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘(( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| 21 | 6, 20 | eqtr3d 2800 | 1 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(𝑋 ∨ 𝑌)) = (( ⊥ ‘𝑋) ∧ ( ⊥ ‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 occoc 17465 joincjn 18514 meetcmee 18515 Latclat 18634 OPcops 40421 OLcol 40423 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-proset 18497 df-poset 18516 df-lub 18547 df-glb 18548 df-join 18549 df-meet 18550 df-lat 18635 df-oposet 40425 df-ol 40427 |
| This theorem is used by: oldmj2 40471 oldmj3 40472 cmtbr2N 40502 omlfh1N 40507 omlfh3N 40508 cvrexch 40669 poldmj1N 41177 lhpmod2i2 41287 lhpmod6i1 41288 djajN 42386 |
| Copyright terms: Public domain | W3C validator |