| 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 11562 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 39199 | . . 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 1539 ∈ wcel 2107 ‘cfv 6560 Basecbs 17248 occoc 17306 OPcops 39174 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2707 ax-nul 5305 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-ne 2940 df-ral 3061 df-rab 3436 df-v 3481 df-dif 3953 df-un 3955 df-ss 3967 df-nul 4333 df-if 4525 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-dm 5694 df-iota 6513 df-fv 6568 df-ov 7435 df-oposet 39178 |
| This theorem is referenced by: opoc0 39205 |
| Copyright terms: Public domain | W3C validator |