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 29204 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 36215 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
5 | simp1 1128 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP) | |
6 | 1, 3 | opoccl 36210 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
7 | 6 | 3adant2 1123 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵) |
8 | 1, 3 | opoccl 36210 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
9 | 8 | 3adant3 1124 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
10 | 1, 2, 3 | oplecon3 36215 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ ( ⊥ ‘𝑌) ∈ 𝐵 ∧ ( ⊥ ‘𝑋) ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
11 | 5, 7, 9, 10 | syl3anc 1363 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)))) |
12 | 1, 3 | opococ 36211 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
13 | 12 | 3adant3 1124 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
14 | 1, 3 | opococ 36211 | . . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
15 | 14 | 3adant2 1123 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) |
16 | 13, 15 | breq12d 5070 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘( ⊥ ‘𝑋)) ≤ ( ⊥ ‘( ⊥ ‘𝑌)) ↔ 𝑋 ≤ 𝑌)) |
17 | 11, 16 | sylibd 240 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → 𝑋 ≤ 𝑌)) |
18 | 4, 17 | impbid 213 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 class class class wbr 5057 ‘cfv 6348 Basecbs 16471 lecple 16560 occoc 16561 OPcops 36188 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-nul 5201 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-dm 5558 df-iota 6307 df-fv 6356 df-ov 7148 df-oposet 36192 |
This theorem is referenced by: oplecon1b 36217 opltcon3b 36220 oldmm1 36233 omllaw4 36262 cvrcmp2 36300 glbconN 36393 lhpmod2i2 37054 lhpmod6i1 37055 lhprelat3N 37056 dochss 38381 |
Copyright terms: Public domain | W3C validator |