Theorem oplecon3 40224

Description: Contraposition law for orthoposets. (Contributed by NM, 13-Sep-2011.)

Hypotheses

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

Assertion

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

Proof of Theorem oplecon3

Step	Hyp	Ref	Expression
1		opcon3.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		opcon3.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		opcon3.o	. . . 4 ⊢ ⊥ = (oc‘𝐾)
4		eqid 2761	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
5		eqid 2761	. . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾)
6		eqid 2761	. . . 4 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		eqid 2761	. . . 4 ⊢ (1.‘𝐾) = (1.‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	oposlem 40207	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋(meet‘𝐾)( ⊥ ‘𝑋)) = (0.‘𝐾)))
9	8	simp1d 1160	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋))))
10	9	simp3d 1162	1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  lecple 17415  occoc 17416  joincjn 18465  meetcmee 18466  0.cp0 18575  1.cp1 18576  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:  oplecon3b  40225