![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > opnoncon | Structured version Visualization version GIF version |
Description: Law of contradiction for orthoposets. (chocin 30435 analog.) (Contributed by NM, 13-Sep-2011.) |
Ref | Expression |
---|---|
opnoncon.b | ⊢ 𝐵 = (Base‘𝐾) |
opnoncon.o | ⊢ ⊥ = (oc‘𝐾) |
opnoncon.m | ⊢ ∧ = (meet‘𝐾) |
opnoncon.z | ⊢ 0 = (0.‘𝐾) |
Ref | Expression |
---|---|
opnoncon | ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opnoncon.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
2 | eqid 2736 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
3 | opnoncon.o | . . . 4 ⊢ ⊥ = (oc‘𝐾) | |
4 | eqid 2736 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
5 | opnoncon.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
6 | opnoncon.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
7 | eqid 2736 | . . . 4 ⊢ (1.‘𝐾) = (1.‘𝐾) | |
8 | 1, 2, 3, 4, 5, 6, 7 | oposlem 37635 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )) |
9 | 8 | 3anidm23 1421 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )) |
10 | 9 | simp3d 1144 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5105 ‘cfv 6496 (class class class)co 7356 Basecbs 17082 lecple 17139 occoc 17140 joincjn 18199 meetcmee 18200 0.cp0 18311 1.cp1 18312 OPcops 37625 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2707 ax-nul 5263 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2714 df-cleq 2728 df-clel 2814 df-ne 2944 df-ral 3065 df-rab 3408 df-v 3447 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-br 5106 df-dm 5643 df-iota 6448 df-fv 6504 df-ov 7359 df-oposet 37629 |
This theorem is referenced by: omlfh1N 37711 omlspjN 37714 atlatmstc 37772 pnonsingN 38387 lhpocnle 38470 dochnoncon 39845 |
Copyright terms: Public domain | W3C validator |