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 37303 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ OP) |
3 | simpr 484 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
4 | 1cvrco.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
5 | 1cvrco.u | . . . . . 6 ⊢ 1 = (1.‘𝐾) | |
6 | 4, 5 | op1cl 37126 | . . . . 5 ⊢ (𝐾 ∈ OP → 1 ∈ 𝐵) |
7 | 2, 6 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → 1 ∈ 𝐵) |
8 | 1cvrco.o | . . . . 5 ⊢ ⊥ = (oc‘𝐾) | |
9 | 1cvrco.c | . . . . 5 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
10 | 4, 8, 9 | cvrcon3b 37218 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 1 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
11 | 2, 3, 7, 10 | syl3anc 1369 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
12 | eqid 2738 | . . . . . 6 ⊢ (0.‘𝐾) = (0.‘𝐾) | |
13 | 12, 5, 8 | opoc1 37143 | . . . . 5 ⊢ (𝐾 ∈ OP → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
14 | 2, 13 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
15 | 14 | breq1d 5080 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋) ↔ (0.‘𝐾)𝐶( ⊥ ‘𝑋))) |
16 | 4, 8 | opoccl 37135 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
17 | 1, 16 | sylan 579 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
18 | 17 | biantrurd 532 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((0.‘𝐾)𝐶( ⊥ ‘𝑋) ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
19 | 11, 15, 18 | 3bitrd 304 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
20 | 1cvrco.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
21 | 4, 12, 9, 20 | isat 37227 | . . 3 ⊢ (𝐾 ∈ HL → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
22 | 21 | adantr 480 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
23 | 19, 22 | bitr4d 281 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘𝑋) ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 Basecbs 16840 occoc 16896 0.cp0 18056 1.cp1 18057 OPcops 37113 ⋖ ccvr 37203 Atomscatm 37204 HLchlt 37291 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-proset 17928 df-poset 17946 df-plt 17963 df-lub 17979 df-glb 17980 df-p0 18058 df-p1 18059 df-oposet 37117 df-ol 37119 df-oml 37120 df-covers 37207 df-ats 37208 df-hlat 37292 |
This theorem is referenced by: 1cvratex 37414 lhpoc 37955 |
Copyright terms: Public domain | W3C validator |