Metamath Proof Explorer


Theorem atord

Description: An ordering law for a Hilbert lattice atom and a commuting subspace. (Contributed by NM, 12-Jun-2006) (New usage is discouraged.)

Ref Expression
Assertion atord ⊢ A ∈ C ℋ ∧ B ∈ HAtoms ∧ A 𝐶 ℋ B → B ⊆ A ∨ B ⊆ ⊥ ⁡ A

Proof

Step Hyp Ref Expression
1 breq1 ⊢ A = if A ∈ C ℋ A 0 ℋ → A 𝐶 ℋ B ↔ if A ∈ C ℋ A 0 ℋ 𝐶 ℋ B
2 1 anbi2d ⊢ A = if A ∈ C ℋ A 0 ℋ → B ∈ HAtoms ∧ A 𝐶 ℋ B ↔ B ∈ HAtoms ∧ if A ∈ C ℋ A 0 ℋ 𝐶 ℋ B
3 sseq2 ⊢ A = if A ∈ C ℋ A 0 ℋ → B ⊆ A ↔ B ⊆ if A ∈ C ℋ A 0 ℋ
4 fveq2 ⊢ A = if A ∈ C ℋ A 0 ℋ → ⊥ ⁡ A = ⊥ ⁡ if A ∈ C ℋ A 0 ℋ
5 4 sseq2d ⊢ A = if A ∈ C ℋ A 0 ℋ → B ⊆ ⊥ ⁡ A ↔ B ⊆ ⊥ ⁡ if A ∈ C ℋ A 0 ℋ
6 3 5 orbi12d ⊢ A = if A ∈ C ℋ A 0 ℋ → B ⊆ A ∨ B ⊆ ⊥ ⁡ A ↔ B ⊆ if A ∈ C ℋ A 0 ℋ ∨ B ⊆ ⊥ ⁡ if A ∈ C ℋ A 0 ℋ
7 2 6 imbi12d ⊢ A = if A ∈ C ℋ A 0 ℋ → B ∈ HAtoms ∧ A 𝐶 ℋ B → B ⊆ A ∨ B ⊆ ⊥ ⁡ A ↔ B ∈ HAtoms ∧ if A ∈ C ℋ A 0 ℋ 𝐶 ℋ B → B ⊆ if A ∈ C ℋ A 0 ℋ ∨ B ⊆ ⊥ ⁡ if A ∈ C ℋ A 0 ℋ
8 h0elch ⊢ 0 ℋ ∈ C ℋ
9 8 elimel ⊢ if A ∈ C ℋ A 0 ℋ ∈ C ℋ
10 9 atordi ⊢ B ∈ HAtoms ∧ if A ∈ C ℋ A 0 ℋ 𝐶 ℋ B → B ⊆ if A ∈ C ℋ A 0 ℋ ∨ B ⊆ ⊥ ⁡ if A ∈ C ℋ A 0 ℋ
11 7 10 dedth ⊢ A ∈ C ℋ → B ∈ HAtoms ∧ A 𝐶 ℋ B → B ⊆ A ∨ B ⊆ ⊥ ⁡ A
12 11 3impib ⊢ A ∈ C ℋ ∧ B ∈ HAtoms ∧ A 𝐶 ℋ B → B ⊆ A ∨ B ⊆ ⊥ ⁡ A