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 29758 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 2738 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
3 | opnoncon.o | . . . 4 ⊢ ⊥ = (oc‘𝐾) | |
4 | eqid 2738 | . . . 4 ⊢ (join‘𝐾) = (join‘𝐾) | |
5 | opnoncon.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
6 | opnoncon.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
7 | eqid 2738 | . . . 4 ⊢ (1.‘𝐾) = (1.‘𝐾) | |
8 | 1, 2, 3, 4, 5, 6, 7 | oposlem 37123 | . . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )) |
9 | 8 | 3anidm23 1419 | . 2 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋 ∧ (𝑋(le‘𝐾)𝑋 → ( ⊥ ‘𝑋)(le‘𝐾)( ⊥ ‘𝑋))) ∧ (𝑋(join‘𝐾)( ⊥ ‘𝑋)) = (1.‘𝐾) ∧ (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 )) |
10 | 9 | simp3d 1142 | 1 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → (𝑋 ∧ ( ⊥ ‘𝑋)) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 lecple 16895 occoc 16896 joincjn 17944 meetcmee 17945 0.cp0 18056 1.cp1 18057 OPcops 37113 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-nul 5225 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-dm 5590 df-iota 6376 df-fv 6426 df-ov 7258 df-oposet 37117 |
This theorem is referenced by: omlfh1N 37199 omlspjN 37202 atlatmstc 37260 pnonsingN 37874 lhpocnle 37957 dochnoncon 39332 |
Copyright terms: Public domain | W3C validator |