opnoncon - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > opnoncon		Structured version Visualization version GIF version

Theorem opnoncon 39578

Description: Law of contradiction for orthoposets. (chocin 31582 analog.) (Contributed by NM, 13-Sep-2011.)

**Hypotheses**
Ref	Expression
opnoncon.b	⊢ 𝐵 = (Base‘𝐾)
opnoncon.o	⊢ ⊥ = (oc‘𝐾)
opnoncon.m	⊢ ∧ = (meet‘𝐾)
opnoncon.z	⊢ 0 = (0.‘𝐾)

**Assertion**
Ref	Expression
opnoncon	⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )

**Proof of Theorem opnoncon**
Step	Hyp	Ref	Expression
1		opnoncon.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		eqid 2737	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
3		opnoncon.o	. . . 4 ⊢ ⊥ = (oc‘𝐾)
4		eqid 2737	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
5		opnoncon.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
6		opnoncon.z	. . . 4 ⊢ 0 = (0.‘𝐾)
7		eqid 2737	. . . 4 ⊢ (1.‘𝐾) = (1.‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	oposlem 39552	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 ))
9	8	3anidm23 1424	. 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 ))
10	9	simp3d 1145	1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 lecple 17196 occoc 17197 joincjn 18246 meetcmee 18247 0.cp0 18356 1.cp1 18357 OPcops 39542

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-nul 5253

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-dm 5642 df-iota 6456 df-fv 6508 df-ov 7371 df-oposet 39546

This theorem is referenced by: omlfh1N 39628 omlspjN 39631 atlatmstc 39689 pnonsingN 40303 lhpocnle 40386 dochnoncon 41761

W3C validator