Metamath Proof Explorer


Theorem shslubi

Description: The least upper bound law for Hilbert subspace sum. (Contributed by NM, 15-Jun-2004) (New usage is discouraged.)

Ref Expression
Hypotheses shslub.1 ⊢ A ∈ S ℋ
shslub.2 ⊢ B ∈ S ℋ
shslub.3 ⊢ C ∈ S ℋ
Assertion shslubi ⊢ A ⊆ C ∧ B ⊆ C ↔ A + ℋ B ⊆ C

Proof

Step Hyp Ref Expression
1 shslub.1 ⊢ A ∈ S ℋ
2 shslub.2 ⊢ B ∈ S ℋ
3 shslub.3 ⊢ C ∈ S ℋ
4 1 3 2 shlessi ⊢ A ⊆ C → A + ℋ B ⊆ C + ℋ B
5 3 2 shscomi ⊢ C + ℋ B = B + ℋ C
6 4 5 sseqtrdi ⊢ A ⊆ C → A + ℋ B ⊆ B + ℋ C
7 2 3 3 shlessi ⊢ B ⊆ C → B + ℋ C ⊆ C + ℋ C
8 3 shsidmi ⊢ C + ℋ C = C
9 7 8 sseqtrdi ⊢ B ⊆ C → B + ℋ C ⊆ C
10 6 9 sylan9ss ⊢ A ⊆ C ∧ B ⊆ C → A + ℋ B ⊆ C
11 1 2 shsub1i ⊢ A ⊆ A + ℋ B
12 sstr ⊢ A ⊆ A + ℋ B ∧ A + ℋ B ⊆ C → A ⊆ C
13 11 12 mpan ⊢ A + ℋ B ⊆ C → A ⊆ C
14 2 1 shsub2i ⊢ B ⊆ A + ℋ B
15 sstr ⊢ B ⊆ A + ℋ B ∧ A + ℋ B ⊆ C → B ⊆ C
16 14 15 mpan ⊢ A + ℋ B ⊆ C → B ⊆ C
17 13 16 jca ⊢ A + ℋ B ⊆ C → A ⊆ C ∧ B ⊆ C
18 10 17 impbii ⊢ A ⊆ C ∧ B ⊆ C ↔ A + ℋ B ⊆ C