| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > opcon1b | Structured version Visualization version GIF version | ||
| Description: Orthocomplement contraposition law. (negcon1 11540 analog.) (Contributed by NM, 24-Jan-2012.) |
| Ref | Expression |
|---|---|
| opoccl.b | ⊢ 𝐵 = (Base‘𝐾) |
| opoccl.o | ⊢ ⊥ = (oc‘𝐾) |
| Ref | Expression |
|---|---|
| opcon1b | ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) = 𝑌 ↔ ( ⊥ ‘𝑌) = 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opoccl.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | opoccl.o | . . . 4 ⊢ ⊥ = (oc‘𝐾) | |
| 3 | 1, 2 | opcon2b 39220 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = ( ⊥ ‘𝑌) ↔ 𝑌 = ( ⊥ ‘𝑋))) |
| 4 | eqcom 2743 | . . 3 ⊢ (( ⊥ ‘𝑌) = 𝑋 ↔ 𝑋 = ( ⊥ ‘𝑌)) | |
| 5 | eqcom 2743 | . . 3 ⊢ (( ⊥ ‘𝑋) = 𝑌 ↔ 𝑌 = ( ⊥ ‘𝑋)) | |
| 6 | 3, 4, 5 | 3bitr4g 314 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = 𝑌)) |
| 7 | 6 | bicomd 223 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) = 𝑌 ↔ ( ⊥ ‘𝑌) = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6536 Basecbs 17233 occoc 17284 OPcops 39195 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 ax-nul 5281 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-ne 2934 df-ral 3053 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-dm 5669 df-iota 6489 df-fv 6544 df-ov 7413 df-oposet 39199 |
| This theorem is referenced by: opoc0 39226 |
| Copyright terms: Public domain | W3C validator |