![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > opltcon1b | Structured version Visualization version GIF version |
Description: Contraposition law for strict ordering in orthoposets. (chpsscon1 28935 analog.) (Contributed by NM, 5-Nov-2011.) |
Ref | Expression |
---|---|
opltcon3.b | ⊢ 𝐵 = (Base‘𝐾) |
opltcon3.s | ⊢ < = (lt‘𝐾) |
opltcon3.o | ⊢ ⊥ = (oc‘𝐾) |
Ref | Expression |
---|---|
opltcon1b | ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) < 𝑌 ↔ ( ⊥ ‘𝑌) < 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opltcon3.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
2 | opltcon3.o | . . . . 5 ⊢ ⊥ = (oc‘𝐾) | |
3 | 1, 2 | opoccl 35348 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
4 | 3 | 3adant3 1123 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵) |
5 | opltcon3.s | . . . 4 ⊢ < = (lt‘𝐾) | |
6 | 1, 5, 2 | opltcon3b 35358 | . . 3 ⊢ ((𝐾 ∈ OP ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) < 𝑌 ↔ ( ⊥ ‘𝑌) < ( ⊥ ‘( ⊥ ‘𝑋)))) |
7 | 4, 6 | syld3an2 1480 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) < 𝑌 ↔ ( ⊥ ‘𝑌) < ( ⊥ ‘( ⊥ ‘𝑋)))) |
8 | 1, 2 | opococ 35349 | . . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
9 | 8 | 3adant3 1123 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋) |
10 | 9 | breq2d 4898 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) < ( ⊥ ‘( ⊥ ‘𝑋)) ↔ ( ⊥ ‘𝑌) < 𝑋)) |
11 | 7, 10 | bitrd 271 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) < 𝑌 ↔ ( ⊥ ‘𝑌) < 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ w3a 1071 = wceq 1601 ∈ wcel 2107 class class class wbr 4886 ‘cfv 6135 Basecbs 16255 occoc 16346 ltcplt 17327 OPcops 35326 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5017 ax-nul 5025 ax-pr 5138 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-rab 3099 df-v 3400 df-sbc 3653 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-nul 4142 df-if 4308 df-sn 4399 df-pr 4401 df-op 4405 df-uni 4672 df-br 4887 df-opab 4949 df-mpt 4966 df-id 5261 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-iota 6099 df-fun 6137 df-fv 6143 df-ov 6925 df-proset 17314 df-poset 17332 df-plt 17344 df-oposet 35330 |
This theorem is referenced by: cvrcon3b 35431 |
Copyright terms: Public domain | W3C validator |