| 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 11477 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 39782 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = ( ⊥ ‘𝑌) ↔ 𝑌 = ( ⊥ ‘𝑋))) |
| 4 | eqcom 2768 | . . 3 ⊢ (( ⊥ ‘𝑌) = 𝑋 ↔ 𝑋 = ( ⊥ ‘𝑌)) | |
| 5 | eqcom 2768 | . . 3 ⊢ (( ⊥ ‘𝑋) = 𝑌 ↔ 𝑌 = ( ⊥ ‘𝑋)) | |
| 6 | 3, 4, 5 | 3bitr4g 316 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = 𝑌)) |
| 7 | 6 | bicomd 225 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) = 𝑌 ↔ ( ⊥ ‘𝑌) = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ‘cfv 6516 Basecbs 17236 occoc 17285 OPcops 39757 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-nul 5253 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3076 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-dm 5653 df-iota 6472 df-fv 6524 df-ov 7394 df-oposet 39761 |
| This theorem is referenced by: opoc0 39788 |
| Copyright terms: Public domain | W3C validator |