Metamath Proof Explorer


Theorem cdlemefs32snb

Description: Show closure of [_ R / s ]_ N . (Contributed by NM, 24-Mar-2013)

Ref Expression
Hypotheses cdlemefs32.b ⊢ B = Base K
cdlemefs32.l ⊢ ≤ ˙ = ≤ K
cdlemefs32.j ⊢ ∨ ˙ = join ⁡ K
cdlemefs32.m ⊢ ∧ ˙ = meet ⁡ K
cdlemefs32.a ⊢ A = Atoms ⁡ K
cdlemefs32.h ⊢ H = LHyp ⁡ K
cdlemefs32.u ⊢ U = P ∨ ˙ Q ∧ ˙ W
cdlemefs32.d ⊢ D = t ∨ ˙ U ∧ ˙ Q ∨ ˙ P ∨ ˙ t ∧ ˙ W
cdlemefs32.e ⊢ E = P ∨ ˙ Q ∧ ˙ D ∨ ˙ s ∨ ˙ t ∧ ˙ W
cdlemefs32.i ⊢ I = ι y ∈ B | ∀ t ∈ A ¬ t ≤ ˙ W ∧ ¬ t ≤ ˙ P ∨ ˙ Q → y = E
cdlemefs32.n ⊢ N = if s ≤ ˙ P ∨ ˙ Q I C
Assertion cdlemefs32snb ⊢ K ∈ HL ∧ W ∈ H ∧ P ∈ A ∧ ¬ P ≤ ˙ W ∧ Q ∈ A ∧ ¬ Q ≤ ˙ W ∧ P ≠ Q ∧ R ∈ A ∧ ¬ R ≤ ˙ W ∧ R ≤ ˙ P ∨ ˙ Q → ⦋ R / s⦌ N ∈ B

Proof

Step Hyp Ref Expression
1 cdlemefs32.b ⊢ B = Base K
2 cdlemefs32.l ⊢ ≤ ˙ = ≤ K
3 cdlemefs32.j ⊢ ∨ ˙ = join ⁡ K
4 cdlemefs32.m ⊢ ∧ ˙ = meet ⁡ K
5 cdlemefs32.a ⊢ A = Atoms ⁡ K
6 cdlemefs32.h ⊢ H = LHyp ⁡ K
7 cdlemefs32.u ⊢ U = P ∨ ˙ Q ∧ ˙ W
8 cdlemefs32.d ⊢ D = t ∨ ˙ U ∧ ˙ Q ∨ ˙ P ∨ ˙ t ∧ ˙ W
9 cdlemefs32.e ⊢ E = P ∨ ˙ Q ∧ ˙ D ∨ ˙ s ∨ ˙ t ∧ ˙ W
10 cdlemefs32.i ⊢ I = ι y ∈ B | ∀ t ∈ A ¬ t ≤ ˙ W ∧ ¬ t ≤ ˙ P ∨ ˙ Q → y = E
11 cdlemefs32.n ⊢ N = if s ≤ ˙ P ∨ ˙ Q I C
12 eqid ⊢ P ∨ ˙ Q ∧ ˙ D ∨ ˙ R ∨ ˙ t ∧ ˙ W = P ∨ ˙ Q ∧ ˙ D ∨ ˙ R ∨ ˙ t ∧ ˙ W
13 eqid ⊢ ι y ∈ B | ∀ t ∈ A ¬ t ≤ ˙ W ∧ ¬ t ≤ ˙ P ∨ ˙ Q → y = P ∨ ˙ Q ∧ ˙ D ∨ ˙ R ∨ ˙ t ∧ ˙ W = ι y ∈ B | ∀ t ∈ A ¬ t ≤ ˙ W ∧ ¬ t ≤ ˙ P ∨ ˙ Q → y = P ∨ ˙ Q ∧ ˙ D ∨ ˙ R ∨ ˙ t ∧ ˙ W
14 1 2 3 4 5 6 7 8 9 10 11 12 13 cdlemefs32sn1aw ⊢ K ∈ HL ∧ W ∈ H ∧ P ∈ A ∧ ¬ P ≤ ˙ W ∧ Q ∈ A ∧ ¬ Q ≤ ˙ W ∧ P ≠ Q ∧ R ∈ A ∧ ¬ R ≤ ˙ W ∧ R ≤ ˙ P ∨ ˙ Q → ⦋ R / s⦌ N ∈ A ∧ ¬ ⦋ R / s⦌ N ≤ ˙ W
15 14 simpld ⊢ K ∈ HL ∧ W ∈ H ∧ P ∈ A ∧ ¬ P ≤ ˙ W ∧ Q ∈ A ∧ ¬ Q ≤ ˙ W ∧ P ≠ Q ∧ R ∈ A ∧ ¬ R ≤ ˙ W ∧ R ≤ ˙ P ∨ ˙ Q → ⦋ R / s⦌ N ∈ A
16 1 5 atbase ⊢ ⦋ R / s⦌ N ∈ A → ⦋ R / s⦌ N ∈ B
17 15 16 syl ⊢ K ∈ HL ∧ W ∈ H ∧ P ∈ A ∧ ¬ P ≤ ˙ W ∧ Q ∈ A ∧ ¬ Q ≤ ˙ W ∧ P ≠ Q ∧ R ∈ A ∧ ¬ R ≤ ˙ W ∧ R ≤ ˙ P ∨ ˙ Q → ⦋ R / s⦌ N ∈ B