| 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 39561 | . . . . 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 39384 | . . . . 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 39476 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 1 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 11 | 2, 3, 7, 10 | syl3anc 1373 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋))) |
| 12 | eqid 2734 | . . . . . 6 ⊢ (0.‘𝐾) = (0.‘𝐾) | |
| 13 | 12, 5, 8 | opoc1 39401 | . . . . 5 ⊢ (𝐾 ∈ OP → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 14 | 2, 13 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘ 1 ) = (0.‘𝐾)) |
| 15 | 14 | breq1d 5106 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘ 1 )𝐶( ⊥ ‘𝑋) ↔ (0.‘𝐾)𝐶( ⊥ ‘𝑋))) |
| 16 | 4, 8 | opoccl 39393 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 17 | 1, 16 | sylan 580 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 18 | 17 | biantrurd 532 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((0.‘𝐾)𝐶( ⊥ ‘𝑋) ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 19 | 11, 15, 18 | 3bitrd 305 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 20 | 1cvrco.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 21 | 4, 12, 9, 20 | isat 39485 | . . 3 ⊢ (𝐾 ∈ HL → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 22 | 21 | adantr 480 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (( ⊥ ‘𝑋) ∈ 𝐴 ↔ (( ⊥ ‘𝑋) ∈ 𝐵 ∧ (0.‘𝐾)𝐶( ⊥ ‘𝑋)))) |
| 23 | 19, 22 | bitr4d 282 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋𝐶 1 ↔ ( ⊥ ‘𝑋) ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 class class class wbr 5096 ‘cfv 6490 Basecbs 17134 occoc 17183 0.cp0 18342 1.cp1 18343 OPcops 39371 ⋖ ccvr 39461 Atomscatm 39462 HLchlt 39549 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-proset 18215 df-poset 18234 df-plt 18249 df-lub 18265 df-glb 18266 df-p0 18344 df-p1 18345 df-oposet 39375 df-ol 39377 df-oml 39378 df-covers 39465 df-ats 39466 df-hlat 39550 |
| This theorem is referenced by: 1cvratex 39672 lhpoc 40213 |
| Copyright terms: Public domain | W3C validator |