Theorem opexmid 39838

Description: Law of excluded middle for orthoposets. (chjo 31772 analog.) (Contributed by NM, 13-Sep-2011.)

Hypotheses

Ref	Expression
opexmid.b	⊢ 𝐵 = (Base‘𝐾)
opexmid.o	⊢ ⊥ = (oc‘𝐾)
opexmid.j	⊢ ∨ = (join‘𝐾)
opexmid.u	⊢ 1 = (1.‘𝐾)

Assertion

Ref	Expression
opexmid	⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 )

Proof of Theorem opexmid

Step	Hyp	Ref	Expression
1		opexmid.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		eqid 2765	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
3		opexmid.o	. . . 4 ⊢ ⊥ = (oc‘𝐾)
4		opexmid.j	. . . 4 ⊢ ∨ = (join‘𝐾)
5		eqid 2765	. . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾)
6		eqid 2765	. . . 4 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		opexmid.u	. . . 4 ⊢ 1 = (1.‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	oposlem 39813	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 ∧ (𝑋(meet‘𝐾)( ⊥ ‘𝑋)) = (0.‘𝐾)))
9	8	3anidm23 1444	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 ∧ (𝑋(meet‘𝐾)( ⊥ ‘𝑋)) = (0.‘𝐾)))
10	9	simp2d 1159	1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 )

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145   class class class wbr 5104  ‘cfv 6525  (class class class)co 7400  Basecbs 17257  lecple 17305  occoc 17306  joincjn 18355  meetcmee 18356  0.cp0 18465  1.cp1 18466  OPcops 39803

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-nul 5260

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-dm 5661  df-iota 6481  df-fv 6533  df-ov 7403  df-oposet 39807

This theorem is referenced by:  dih1  41917