| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > oplecon3b | Structured version Visualization version GIF version | ||
| Description: Contraposition law for orthoposets. (chsscon3 32084 analog.) (Contributed by NM, 4-Nov-2011.) |
| Ref | Expression |
|---|---|
| opcon3.b | ⊢ 𝐵 = (Base‘𝐾) |
| opcon3.l | ⊢ ≤ = (le‘𝐾) |
| opcon3.o | ⊢ ⊥ = (oc‘𝐾) |
| Ref | Expression |
|---|---|
| oplecon3b | ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opcon3.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | opcon3.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | opcon3.o | . . 3 ⊢ ⊥ = (oc‘𝐾) | |
| 4 | 1, 2, 3 | oplecon3 40224 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
| 5 | simp1 1154 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) | |
| 6 | 1, 3 | opoccl 40219 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 7 | 6 | 3adant2 1149 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
| 8 | 1, 3 | opoccl 40219 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 9 | 8 | 3adant3 1150 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
| 10 | 1, 2, 3 | oplecon3 40224 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ ( ⊥ ‘𝑌) ∈ 𝐵 ∧ ( ⊥ ‘𝑋) ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
| 11 | 5, 7, 9, 10 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
| 12 | 1, 3 | opococ 40220 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
| 13 | 12 | 3adant3 1150 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
| 14 | 1, 3 | opococ 40220 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 15 | 14 | 3adant2 1149 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
| 16 | 13, 15 | breq12d 5116 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)) ↔ 𝑋 ≤ 𝑌)) |
| 17 | 11, 16 | sylibd 242 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → 𝑋 ≤ 𝑌)) |
| 18 | 4, 17 | impbid 215 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6531 Basecbs 17367 lecple 17415 occoc 17416 OPcops 40197 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-nul 5260 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-dm 5661 df-iota 6487 df-fv 6539 df-ov 7415 df-oposet 40201 |
| This theorem is used by: oplecon1b 40226 opltcon3b 40229 oldmm1 40242 omllaw4 40271 cvrcmp2 40309 glbconN 40402 lhpmod2i2 41063 lhpmod6i1 41064 lhprelat3N 41065 dochss 42390 |
| Copyright terms: Public domain | W3C validator |