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 29763 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 37140 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
5 | simp1 1134 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) | |
6 | 1, 3 | opoccl 37135 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
7 | 6 | 3adant2 1129 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
8 | 1, 3 | opoccl 37135 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
9 | 8 | 3adant3 1130 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
10 | 1, 2, 3 | oplecon3 37140 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ ( ⊥ ‘𝑌) ∈ 𝐵 ∧ ( ⊥ ‘𝑋) ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
11 | 5, 7, 9, 10 | syl3anc 1369 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
12 | 1, 3 | opococ 37136 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
13 | 12 | 3adant3 1130 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
14 | 1, 3 | opococ 37136 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
15 | 14 | 3adant2 1129 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
16 | 13, 15 | breq12d 5083 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)) ↔ 𝑋 ≤ 𝑌)) |
17 | 11, 16 | sylibd 238 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → 𝑋 ≤ 𝑌)) |
18 | 4, 17 | impbid 211 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 Basecbs 16840 lecple 16895 occoc 16896 OPcops 37113 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-nul 5225 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-dm 5590 df-iota 6376 df-fv 6426 df-ov 7258 df-oposet 37117 |
This theorem is referenced by: oplecon1b 37142 opltcon3b 37145 oldmm1 37158 omllaw4 37187 cvrcmp2 37225 glbconN 37318 lhpmod2i2 37979 lhpmod6i1 37980 lhprelat3N 37981 dochss 39306 |
Copyright terms: Public domain | W3C validator |