Metamath Proof Explorer


Theorem chirred

Description: The Hilbert lattice is irreducible: any element that commutes with all elements must be zero or one. Theorem 14.8.4 of BeltramettiCassinelli p. 166. (Contributed by NM, 16-Jun-2006) (New usage is discouraged.)

Ref Expression
Assertion chirred ⊢ A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x → A = 0 ℋ ∨ A = ℋ

Proof

Step Hyp Ref Expression
1 eqeq1 ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A = 0 ℋ ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = 0 ℋ
2 eqeq1 ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A = ℋ ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = ℋ
3 1 2 orbi12d ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A = 0 ℋ ∨ A = ℋ ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = 0 ℋ ∨ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = ℋ
4 eleq1 ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A ∈ C ℋ ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ
5 nfv ⊢ Ⅎ x A ∈ C ℋ
6 nfra1 ⊢ Ⅎ x ∀ x ∈ C ℋ A 𝐶 ℋ x
7 5 6 nfan ⊢ Ⅎ x A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x
8 nfcv ⊢ Ⅎ _ x A
9 nfcv ⊢ Ⅎ _ x 0 ℋ
10 7 8 9 nfif ⊢ Ⅎ _ x if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ
11 10 nfeq2 ⊢ Ⅎ x A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ
12 breq1 ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A 𝐶 ℋ x ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
13 11 12 ralbid ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → ∀ x ∈ C ℋ A 𝐶 ℋ x ↔ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
14 4 13 anbi12d ⊢ A = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ ∧ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
15 eleq1 ⊢ 0 ℋ = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → 0 ℋ ∈ C ℋ ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ
16 10 nfeq2 ⊢ Ⅎ x 0 ℋ = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ
17 breq1 ⊢ 0 ℋ = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → 0 ℋ 𝐶 ℋ x ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
18 16 17 ralbid ⊢ 0 ℋ = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → ∀ x ∈ C ℋ 0 ℋ 𝐶 ℋ x ↔ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
19 15 18 anbi12d ⊢ 0 ℋ = if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ → 0 ℋ ∈ C ℋ ∧ ∀ x ∈ C ℋ 0 ℋ 𝐶 ℋ x ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ ∧ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
20 h0elch ⊢ 0 ℋ ∈ C ℋ
21 cm0 ⊢ x ∈ C ℋ → 0 ℋ 𝐶 ℋ x
22 21 rgen ⊢ ∀ x ∈ C ℋ 0 ℋ 𝐶 ℋ x
23 20 22 pm3.2i ⊢ 0 ℋ ∈ C ℋ ∧ ∀ x ∈ C ℋ 0 ℋ 𝐶 ℋ x
24 14 19 23 elimhyp ⊢ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ ∧ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
25 24 simpli ⊢ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ ∈ C ℋ
26 24 simpri ⊢ ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x
27 nfcv ⊢ Ⅎ _ x 𝐶 ℋ
28 nfcv ⊢ Ⅎ _ x y
29 10 27 28 nfbr ⊢ Ⅎ x if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ y
30 breq2 ⊢ x = y → if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x ↔ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ y
31 29 30 rspc ⊢ y ∈ C ℋ → ∀ x ∈ C ℋ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ x → if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ y
32 26 31 mpi ⊢ y ∈ C ℋ → if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ 𝐶 ℋ y
33 25 32 chirredi ⊢ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = 0 ℋ ∨ if A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x A 0 ℋ = ℋ
34 3 33 dedth ⊢ A ∈ C ℋ ∧ ∀ x ∈ C ℋ A 𝐶 ℋ x → A = 0 ℋ ∨ A = ℋ