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 27456 | . . . . . . . . 9 ⊢ 𝐴 ∈ ℋ |
4 | omlsilem.1 | . . . . . . . . . 10 ⊢ 𝐺 ∈ Sℋ | |
5 | omlsilem.6 | . . . . . . . . . 10 ⊢ 𝐵 ∈ 𝐺 | |
6 | 4, 5 | shelii 27456 | . . . . . . . . 9 ⊢ 𝐵 ∈ ℋ |
7 | shocss 27529 | . . . . . . . . . . 11 ⊢ (𝐺 ∈ Sℋ → (⊥‘𝐺) ⊆ ℋ) | |
8 | 4, 7 | ax-mp 5 | . . . . . . . . . 10 ⊢ (⊥‘𝐺) ⊆ ℋ |
9 | omlsilem.7 | . . . . . . . . . 10 ⊢ 𝐶 ∈ (⊥‘𝐺) | |
10 | 8, 9 | sselii 3565 | . . . . . . . . 9 ⊢ 𝐶 ∈ ℋ |
11 | 3, 6, 10 | hvsubaddi 27307 | . . . . . . . 8 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ (𝐵 +ℎ 𝐶) = 𝐴) |
12 | eqcom 2617 | . . . . . . . 8 ⊢ ((𝐵 +ℎ 𝐶) = 𝐴 ↔ 𝐴 = (𝐵 +ℎ 𝐶)) | |
13 | 11, 12 | bitri 263 | . . . . . . 7 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ 𝐴 = (𝐵 +ℎ 𝐶)) |
14 | omlsilem.3 | . . . . . . . . . 10 ⊢ 𝐺 ⊆ 𝐻 | |
15 | 14, 5 | sselii 3565 | . . . . . . . . 9 ⊢ 𝐵 ∈ 𝐻 |
16 | shsubcl 27461 | . . . . . . . . 9 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻 ∧ 𝐵 ∈ 𝐻) → (𝐴 −ℎ 𝐵) ∈ 𝐻) | |
17 | 1, 2, 15, 16 | mp3an 1416 | . . . . . . . 8 ⊢ (𝐴 −ℎ 𝐵) ∈ 𝐻 |
18 | eleq1 2676 | . . . . . . . 8 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 → ((𝐴 −ℎ 𝐵) ∈ 𝐻 ↔ 𝐶 ∈ 𝐻)) | |
19 | 17, 18 | mpbii 222 | . . . . . . 7 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 → 𝐶 ∈ 𝐻) |
20 | 13, 19 | sylbir 224 | . . . . . 6 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐶 ∈ 𝐻) |
21 | omlsilem.4 | . . . . . . . . 9 ⊢ (𝐻 ∩ (⊥‘𝐺)) = 0ℋ | |
22 | 21 | eleq2i 2680 | . . . . . . . 8 ⊢ (𝐶 ∈ (𝐻 ∩ (⊥‘𝐺)) ↔ 𝐶 ∈ 0ℋ) |
23 | elin 3758 | . . . . . . . 8 ⊢ (𝐶 ∈ (𝐻 ∩ (⊥‘𝐺)) ↔ (𝐶 ∈ 𝐻 ∧ 𝐶 ∈ (⊥‘𝐺))) | |
24 | elch0 27495 | . . . . . . . 8 ⊢ (𝐶 ∈ 0ℋ ↔ 𝐶 = 0ℎ) | |
25 | 22, 23, 24 | 3bitr3i 289 | . . . . . . 7 ⊢ ((𝐶 ∈ 𝐻 ∧ 𝐶 ∈ (⊥‘𝐺)) ↔ 𝐶 = 0ℎ) |
26 | 25 | biimpi 205 | . . . . . 6 ⊢ ((𝐶 ∈ 𝐻 ∧ 𝐶 ∈ (⊥‘𝐺)) → 𝐶 = 0ℎ) |
27 | 20, 9, 26 | sylancl 693 | . . . . 5 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐶 = 0ℎ) |
28 | 27 | oveq2d 6565 | . . . 4 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) = (𝐵 +ℎ 0ℎ)) |
29 | ax-hvaddid 27245 | . . . . 5 ⊢ (𝐵 ∈ ℋ → (𝐵 +ℎ 0ℎ) = 𝐵) | |
30 | 6, 29 | ax-mp 5 | . . . 4 ⊢ (𝐵 +ℎ 0ℎ) = 𝐵 |
31 | 28, 30 | syl6eq 2660 | . . 3 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) = 𝐵) |
32 | 31, 5 | syl6eqel 2696 | . 2 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐵 +ℎ 𝐶) ∈ 𝐺) |
33 | eleq1 2676 | . 2 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → (𝐴 ∈ 𝐺 ↔ (𝐵 +ℎ 𝐶) ∈ 𝐺)) | |
34 | 32, 33 | mpbird 246 | 1 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) → 𝐴 ∈ 𝐺) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∩ cin 3539 ⊆ wss 3540 ‘cfv 5804 (class class class)co 6549 ℋchil 27160 +ℎ cva 27161 0ℎc0v 27165 −ℎ cmv 27166 Sℋ csh 27169 ⊥cort 27171 0ℋc0h 27176 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-hilex 27240 ax-hfvadd 27241 ax-hvcom 27242 ax-hvass 27243 ax-hv0cl 27244 ax-hvaddid 27245 ax-hfvmul 27246 ax-hvmulid 27247 ax-hvdistr2 27250 ax-hvmul0 27251 ax-hfi 27320 ax-his2 27324 ax-his3 27325 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-ltxr 9958 df-sub 10147 df-neg 10148 df-hvsub 27212 df-sh 27448 df-oc 27493 df-ch0 27494 |
This theorem is referenced by: omlsii 27646 |
Copyright terms: Public domain | W3C validator |