| 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 40196 | . . . . 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 40019 | . . . . 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 40111 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 1 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 11 | 2, 3, 7, 10 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 12 | eqid 2765 | . . . . . 6 ⊢ (0.‘𝐾) = (0.‘𝐾) | |
| 13 | 12, 5, 8 | opoc1 40036 | . . . . 5 ⊢ (𝐾 ∈ OP → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 14 | 2, 13 | syl 18 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 15 | 14 | breq1d 5121 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋) ↔ (0.‘𝐾)𝐶( ⊥ ‘𝑋))) |
| 16 | 4, 8 | opoccl 40028 | . . . . 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 40120 | . . 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 1570 ∈ wcel 2146 class class class wbr 5111 ‘cfv 6540 Basecbs 17293 occoc 17342 0.cp0 18501 1.cp1 18502 OPcops 40006 ⋖ ccvr 40096 Atomscatm 40097 HLchlt 40184 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-proset 18374 df-poset 18393 df-plt 18408 df-lub 18424 df-glb 18425 df-p0 18503 df-p1 18504 df-oposet 40010 df-ol 40012 df-oml 40013 df-covers 40100 df-ats 40101 df-hlat 40185 |
| This theorem is used by: 1cvratex 40307 lhpoc 40848 |
| Copyright terms: Public domain | W3C validator |