Theorem opexmid 39463

Description: Law of excluded middle for orthoposets. (chjo 31590 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 2736	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
3		opexmid.o	. . . 4 ⊢ ⊥ = (oc‘𝐾)
4		opexmid.j	. . . 4 ⊢ ∨ = (join‘𝐾)
5		eqid 2736	. . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾)
6		eqid 2736	. . . 4 ⊢ (0.‘𝐾) = (0.‘𝐾)
7		opexmid.u	. . . 4 ⊢ 1 = (1.‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	oposlem 39438	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 ∧ (𝑋(meet‘𝐾)( ⊥ ‘𝑋)) = (0.‘𝐾)))
9	8	3anidm23 1423	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 ∧ (𝑋(meet‘𝐾)( ⊥ ‘𝑋)) = (0.‘𝐾)))
10	9	simp2d 1143	1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∨ ( ⊥ ‘𝑋)) = 1 )

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  lecple 17184  occoc 17185  joincjn 18234  meetcmee 18235  0.cp0 18344  1.cp1 18345  OPcops 39428

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-nul 5251

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-dm 5634  df-iota 6448  df-fv 6500  df-ov 7361  df-oposet 39432

This theorem is referenced by:  dih1  41542