Theorem oplecon1b 39201

Description: Contraposition law for strict ordering in orthoposets. (chsscon1 31437 analog.) (Contributed by NM, 6-Nov-2011.)

Hypotheses

Ref	Expression
opcon3.b	⊢ 𝐵 = (Base‘𝐾)
opcon3.l	⊢ ≤ = (le‘𝐾)
opcon3.o	⊢ ⊥ = (oc‘𝐾)

Assertion

Ref	Expression
oplecon1b	⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ 𝑋))

Proof of Theorem oplecon1b

Step	Hyp	Ref	Expression
1		opcon3.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
2		opcon3.o	. . . . 5 ⊢ ⊥ = (oc‘𝐾)
3	1, 2	opoccl 39194	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵)
4	3	3adant3 1132	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵)
5		opcon3.l	. . . 4 ⊢ ≤ = (le‘𝐾)
6	1, 5, 2	oplecon3b 39200	. . 3 ⊢ ((𝐾 ∈ OP ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘( ⊥ ‘𝑋))))
7	4, 6	syld3an2 1413	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘( ⊥ ‘𝑋))))
8	1, 2	opococ 39195	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)
9	8	3adant3 1132	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)
10	9	breq2d 5122	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘( ⊥ ‘𝑋)) ↔ ( ⊥ ‘𝑌) ≤ 𝑋))
11	7, 10	bitrd 279	1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ 𝑋))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   class class class wbr 5110  ‘cfv 6514  Basecbs 17186  lecple 17234  occoc 17235  OPcops 39172

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-nul 5264

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-dm 5651  df-iota 6467  df-fv 6522  df-ov 7393  df-oposet 39176

This theorem is referenced by:  opoc1  39202  oldmm1  39217