| 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 11506 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 39856 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = ( ⊥ ‘𝑌) ↔ 𝑌 = ( ⊥ ‘𝑋))) |
| 4 | eqcom 2776 | . . 3 ⊢ (( ⊥ ‘𝑌) = 𝑋 ↔ 𝑋 = ( ⊥ ‘𝑌)) | |
| 5 | eqcom 2776 | . . 3 ⊢ (( ⊥ ‘𝑋) = 𝑌 ↔ 𝑌 = ( ⊥ ‘𝑋)) | |
| 6 | 3, 4, 5 | 3bitr4g 317 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = 𝑌)) |
| 7 | 6 | bicomd 226 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) = 𝑌 ↔ ( ⊥ ‘𝑌) = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ‘cfv 6533 Basecbs 17265 occoc 17314 OPcops 39831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-nul 5268 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-dm 5669 df-iota 6489 df-fv 6541 df-ov 7411 df-oposet 39835 |
| This theorem is referenced by: opoc0 39862 |
| Copyright terms: Public domain | W3C validator |