| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 1cvrco | Structured version Visualization version GIF version | ||
| Description: The orthocomplement of an element covered by 1 is an atom. (Contributed by NM, 7-May-2012.) |
| Ref | Expression |
|---|---|
| 1cvrco.b | ⊢ 𝐵 = (Base‘𝐾) |
| 1cvrco.u | ⊢ 1 = (1.‘𝐾) |
| 1cvrco.o | ⊢ ⊥ = (oc‘𝐾) |
| 1cvrco.c | ⊢ 𝐶 = ( ⋖ ‘𝐾) |
| 1cvrco.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| 1cvrco | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘𝑋) ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hlop 40556 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ OP) |
| 3 | simpr 490 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 4 | 1cvrco.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | 1cvrco.u | . . . . . 6 ⊢ 1 = (1.‘𝐾) | |
| 6 | 4, 5 | op1cl 40379 | . . . . 5 ⊢ (𝐾 ∈ OP → 1 ∈ 𝐵) |
| 7 | 2, 6 | syl 18 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 1 ∈ 𝐵) |
| 8 | 1cvrco.o | . . . . 5 ⊢ ⊥ = (oc‘𝐾) | |
| 9 | 1cvrco.c | . . . . 5 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
| 10 | 4, 8, 9 | cvrcon3b 40471 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 1 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 11 | 2, 3, 7, 10 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 12 | eqid 2760 | . . . . . 6 ⊢ (0.‘𝐾) = (0.‘𝐾) | |
| 13 | 12, 5, 8 | opoc1 40396 | . . . . 5 ⊢ (𝐾 ∈ OP → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 14 | 2, 13 | syl 18 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 15 | 14 | breq1d 5112 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋) ↔ (0.‘𝐾)𝐶( ⊥ ‘𝑋))) |
| 16 | 4, 8 | opoccl 40388 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 17 | 1, 16 | sylan 592 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 18 | 17 | biantrurd 542 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((0.‘𝐾)𝐶( ⊥ ‘𝑋) ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 19 | 11, 15, 18 | 3bitrd 308 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 20 | 1cvrco.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 21 | 4, 12, 9, 20 | isat 40480 | . . 3 ⊢ (𝐾 ∈ HL → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 22 | 21 | adantr 486 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 23 | 19, 22 | bitr4d 285 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘𝑋) ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6543 Basecbs 17396 occoc 17445 0.cp0 18604 1.cp1 18605 OPcops 40366 ⋖ ccvr 40456 Atomscatm 40457 HLchlt 40544 |
| 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 5327 ax-pr 5391 ax-un 7755 |
| 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 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-proset 18477 df-poset 18496 df-plt 18511 df-lub 18527 df-glb 18528 df-p0 18606 df-p1 18607 df-oposet 40370 df-ol 40372 df-oml 40373 df-covers 40460 df-ats 40461 df-hlat 40545 |
| This theorem is used by: 1cvratex 40667 lhpoc 41208 |
| Copyright terms: Public domain | W3C validator |