This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.

Metamath Proof Explorer

Theorem cdlemefs32fva1

Description: Part of proof of Lemma E in Crawley p. 113. TODO: FIX COMMENT. (Contributed by NM, 29-Mar-2013)

Ref Expression
Hypotheses cdlemefs32.b ⊢ 𝐵 = ( Base ‘ 𝐾 )
cdlemefs32.l ⊢ ≤ = ( le ‘ 𝐾 )
cdlemefs32.j ⊢ ∨ = ( join ‘ 𝐾 )
cdlemefs32.m ⊢ ∧ = ( meet ‘ 𝐾 )
cdlemefs32.a ⊢ 𝐴 = ( Atoms ‘ 𝐾 )
cdlemefs32.h ⊢ 𝐻 = ( LHyp ‘ 𝐾 )
cdlemefs32.u ⊢ 𝑈 = ( ( 𝑃 ∨ 𝑄 ) ∧ 𝑊 )
cdlemefs32.d ⊢ 𝐷 = ( ( 𝑡 ∨ 𝑈 ) ∧ ( 𝑄 ∨ ( ( 𝑃 ∨ 𝑡 ) ∧ 𝑊 ) ) )
cdlemefs32.e ⊢ 𝐸 = ( ( 𝑃 ∨ 𝑄 ) ∧ ( 𝐷 ∨ ( ( 𝑠 ∨ 𝑡 ) ∧ 𝑊 ) ) )
cdlemefs32.i ⊢ 𝐼 = ( ℩ 𝑦 ∈ 𝐵 ∀ 𝑡 ∈ 𝐴 ( ( ¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ ( 𝑃 ∨ 𝑄 ) ) → 𝑦 = 𝐸 ) )
cdlemefs32.n ⊢ 𝑁 = if ( 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) , 𝐼 , 𝐶 )
cdleme29fs.o ⊢ 𝑂 = ( ℩ 𝑧 ∈ 𝐵 ∀ 𝑠 ∈ 𝐴 ( ( ¬ 𝑠 ≤ 𝑊 ∧ ( 𝑠 ∨ ( 𝑥 ∧ 𝑊 ) ) = 𝑥 ) → 𝑧 = ( 𝑁 ∨ ( 𝑥 ∧ 𝑊 ) ) ) )
cdleme29fs.f ⊢ 𝐹 = ( 𝑥 ∈ 𝐵 ↦ if ( ( 𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊 ) , 𝑂 , 𝑥 ) )
Assertion cdlemefs32fva1 ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝑃 ≠ 𝑄 ∧ ( 𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊 ) ) ∧ 𝑅 ≤ ( 𝑃 ∨ 𝑄 ) ) → ( 𝐹 ‘ 𝑅 ) = ⦋ 𝑅 / 𝑠 ⦌ 𝑁 )

Proof

Step Hyp Ref Expression
1 cdlemefs32.b ⊢ 𝐵 = ( Base ‘ 𝐾 )
2 cdlemefs32.l ⊢ ≤ = ( le ‘ 𝐾 )
3 cdlemefs32.j ⊢ ∨ = ( join ‘ 𝐾 )
4 cdlemefs32.m ⊢ ∧ = ( meet ‘ 𝐾 )
5 cdlemefs32.a ⊢ 𝐴 = ( Atoms ‘ 𝐾 )
6 cdlemefs32.h ⊢ 𝐻 = ( LHyp ‘ 𝐾 )
7 cdlemefs32.u ⊢ 𝑈 = ( ( 𝑃 ∨ 𝑄 ) ∧ 𝑊 )
8 cdlemefs32.d ⊢ 𝐷 = ( ( 𝑡 ∨ 𝑈 ) ∧ ( 𝑄 ∨ ( ( 𝑃 ∨ 𝑡 ) ∧ 𝑊 ) ) )
9 cdlemefs32.e ⊢ 𝐸 = ( ( 𝑃 ∨ 𝑄 ) ∧ ( 𝐷 ∨ ( ( 𝑠 ∨ 𝑡 ) ∧ 𝑊 ) ) )
10 cdlemefs32.i ⊢ 𝐼 = ( ℩ 𝑦 ∈ 𝐵 ∀ 𝑡 ∈ 𝐴 ( ( ¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ ( 𝑃 ∨ 𝑄 ) ) → 𝑦 = 𝐸 ) )
11 cdlemefs32.n ⊢ 𝑁 = if ( 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) , 𝐼 , 𝐶 )
12 cdleme29fs.o ⊢ 𝑂 = ( ℩ 𝑧 ∈ 𝐵 ∀ 𝑠 ∈ 𝐴 ( ( ¬ 𝑠 ≤ 𝑊 ∧ ( 𝑠 ∨ ( 𝑥 ∧ 𝑊 ) ) = 𝑥 ) → 𝑧 = ( 𝑁 ∨ ( 𝑥 ∧ 𝑊 ) ) ) )
13 cdleme29fs.f ⊢ 𝐹 = ( 𝑥 ∈ 𝐵 ↦ if ( ( 𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊 ) , 𝑂 , 𝑥 ) )
14 breq1 ⊢ ( 𝑠 = 𝑅 → ( 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ↔ 𝑅 ≤ ( 𝑃 ∨ 𝑄 ) ) )
15 simp1 ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) )
16 simp3l ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → 𝑠 ∈ 𝐴 )
17 simp3rl ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → ¬ 𝑠 ≤ 𝑊 )
18 16 17 jca ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → ( 𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊 ) )
19 simp3rr ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) )
20 simp2 ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → 𝑃 ≠ 𝑄 )
21 1 2 3 4 5 6 7 8 9 10 11 cdlemefs27cl ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( ( 𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊 ) ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ∧ 𝑃 ≠ 𝑄 ) ) → 𝑁 ∈ 𝐵 )
22 15 18 19 20 21 syl13anc ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ 𝑃 ≠ 𝑄 ∧ ( 𝑠 ∈ 𝐴 ∧ ( ¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) ) ) ) → 𝑁 ∈ 𝐵 )
23 1 2 3 4 5 6 7 8 9 10 11 cdlemefs32snb ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝑃 ≠ 𝑄 ∧ ( 𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊 ) ) ∧ 𝑅 ≤ ( 𝑃 ∨ 𝑄 ) ) → ⦋ 𝑅 / 𝑠 ⦌ 𝑁 ∈ 𝐵 )
24 1 2 3 4 5 6 14 22 23 12 13 cdlemefrs32fva1 ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝑃 ≠ 𝑄 ∧ ( 𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊 ) ) ∧ 𝑅 ≤ ( 𝑃 ∨ 𝑄 ) ) → ( 𝐹 ‘ 𝑅 ) = ⦋ 𝑅 / 𝑠 ⦌ 𝑁 )