| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > omlsilem | Structured version Visualization version GIF version | ||
| Description: Lemma for orthomodular law in the Hilbert lattice. (Contributed by NM, 14-Oct-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| omlsilem.1 | ⊢ 𝐺 ∈ Sℋ |
| omlsilem.2 | ⊢ 𝐻 ∈ Sℋ |
| omlsilem.3 | ⊢ 𝐺 ⊆ 𝐻 |
| omlsilem.4 | ⊢ (𝐻 ∩ (⊥‘𝐺)) = 0ℋ |
| omlsilem.5 | ⊢ 𝐴 ∈ 𝐻 |
| omlsilem.6 | ⊢ 𝐵 ∈ 𝐺 |
| omlsilem.7 | ⊢ 𝐶 ∈ (⊥‘𝐺) |
| Ref | Expression |
|---|---|
| omlsilem | ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐴 ∈ 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omlsilem.2 | . . . . . . . . . 10 ⊢ 𝐻 ∈ Sℋ | |
| 2 | omlsilem.5 | . . . . . . . . . 10 ⊢ 𝐴 ∈ 𝐻 | |
| 3 | 1, 2 | shelii 31876 | . . . . . . . . 9 ⊢ 𝐴 ∈ ℋ |
| 4 | omlsilem.1 | . . . . . . . . . 10 ⊢ 𝐺 ∈ Sℋ | |
| 5 | omlsilem.6 | . . . . . . . . . 10 ⊢ 𝐵 ∈ 𝐺 | |
| 6 | 4, 5 | shelii 31876 | . . . . . . . . 9 ⊢ 𝐵 ∈ ℋ |
| 7 | shocss 31947 | . . . . . . . . . . 11 ⊢ (𝐺 ∈ Sℋ → (⊥‘𝐺) ⊆ ℋ) | |
| 8 | 4, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (⊥‘𝐺) ⊆ ℋ |
| 9 | omlsilem.7 | . . . . . . . . . 10 ⊢ 𝐶 ∈ (⊥‘𝐺) | |
| 10 | 8, 9 | sselii 3909 | . . . . . . . . 9 ⊢ 𝐶 ∈ ℋ |
| 11 | 3, 6, 10 | hvsubaddi 31727 | . . . . . . . 8 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ (𝐵 +ℎ 𝐶) = 𝐴) |
| 12 | eqcom 2773 | . . . . . . . 8 ⊢ ((𝐵 +ℎ 𝐶) = 𝐴 ↔ 𝐴 = (𝐵 +ℎ 𝐶)) | |
| 13 | 11, 12 | bitri 278 | . . . . . . 7 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ 𝐴 = (𝐵 +ℎ 𝐶)) |
| 14 | omlsilem.3 | . . . . . . . . . 10 ⊢ 𝐺 ⊆ 𝐻 | |
| 15 | 14, 5 | sselii 3909 | . . . . . . . . 9 ⊢ 𝐵 ∈ 𝐻 |
| 16 | shsubcl 31881 | . . . . . . . . 9 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻 ∧ 𝐵 ∈ 𝐻) → (𝐴 −ℎ 𝐵) ∈ 𝐻) | |
| 17 | 1, 2, 15, 16 | mp3an 1493 | . . . . . . . 8 ⊢ (𝐴 −ℎ 𝐵) ∈ 𝐻 |
| 18 | eleq1 2855 | . . . . . . . 8 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 → ((𝐴 −ℎ 𝐵) ∈ 𝐻 ↔ 𝐶 ∈ 𝐻)) | |
| 19 | 17, 18 | mpbii 236 | . . . . . . 7 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 → 𝐶 ∈ 𝐻) |
| 20 | 13, 19 | sylbir 238 | . . . . . 6 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐶 ∈ 𝐻) |
| 21 | omlsilem.4 | . . . . . . . 8 ⊢ (𝐻 ∩ (⊥‘𝐺)) = 0ℋ | |
| 22 | 21 | eleq2i 2859 | . . . . . . 7 ⊢ (𝐶 ∈ (𝐻 ∩ (⊥‘𝐺)) ↔ 𝐶 ∈ 0ℋ) |
| 23 | elin 4095 | . . . . . . 7 ⊢ (𝐶 ∈ (𝐻 ∩ (⊥‘𝐺)) ↔ (𝐶 ∈ 𝐻 ∧ 𝐶 ∈ (⊥‘𝐺))) | |
| 24 | elch0 31915 | . . . . . . 7 ⊢ (𝐶 ∈ 0ℋ ↔ 𝐶 = 0ℎ) | |
| 25 | 22, 23, 24 | 3bitr3i 304 | . . . . . 6 ⊢ ((𝐶 ∈ 𝐻 ∧ 𝐶 ∈ (⊥‘𝐺)) ↔ 𝐶 = 0ℎ) |
| 26 | 20, 9, 25 | sylanblc 601 | . . . . 5 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐶 = 0ℎ) |
| 27 | 26 | oveq2d 7466 | . . . 4 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) = (𝐵 +ℎ 0ℎ)) |
| 28 | ax-hvaddid 31665 | . . . . 5 ⊢ (𝐵 ∈ ℋ → (𝐵 +ℎ 0ℎ) = 𝐵) | |
| 29 | 6, 28 | ax-mp 5 | . . . 4 ⊢ (𝐵 +ℎ 0ℎ) = 𝐵 |
| 30 | 27, 29 | eqtrdi 2817 | . . 3 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) = 𝐵) |
| 31 | 30, 5 | eqeltrdi 2875 | . 2 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) ∈ 𝐺) |
| 32 | eleq1 2855 | . 2 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐴 ∈ 𝐺 ↔ (𝐵 +ℎ 𝐶) ∈ 𝐺)) | |
| 33 | 31, 32 | mpbird 260 | 1 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐴 ∈ 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ⊆ wss 3899 ∩ cin 4091 ‘cfv 6565 (class class class)co 7450 ℋchba 31580 +ℎ cva 31581 0ℎc0v 31585 −ℎ cmv 31586 Sℋ csh 31589 ⊥cort 31591 0ℋc0h 31596 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-hilex 31660 ax-hfvadd 31661 ax-hvcom 31662 ax-hvass 31663 ax-hv0cl 31664 ax-hvaddid 31665 ax-hfvmul 31666 ax-hvmulid 31667 ax-hvdistr2 31670 ax-hvmul0 31671 ax-hfi 31740 ax-his2 31744 ax-his3 31745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-po 5565 df-so 5566 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-ltxr 11386 df-sub 11581 df-neg 11582 df-hvsub 31632 df-sh 31868 df-oc 31913 df-ch0 31914 |
| This theorem is used by: omlsii 32064 |
| Copyright terms: Public domain | W3C validator |