Metamath Proof Explorer

Theorem cdlemg40

Description: Eliminate P =/= Q conditions from cdlemg39 . TODO: Fix comment. (Contributed by NM, 31-May-2013)

Ref Expression
Hypotheses cdlemg35.l ⊢ ≤ = ( le ‘ 𝐾 )
cdlemg35.j ⊢ ∨ = ( join ‘ 𝐾 )
cdlemg35.m ⊢ ∧ = ( meet ‘ 𝐾 )
cdlemg35.a ⊢ 𝐴 = ( Atoms ‘ 𝐾 )
cdlemg35.h ⊢ 𝐻 = ( LHyp ‘ 𝐾 )
cdlemg35.t ⊢ 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
Assertion cdlemg40 ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )

Proof

Step Hyp Ref Expression
1 cdlemg35.l ⊢ ≤ = ( le ‘ 𝐾 )
2 cdlemg35.j ⊢ ∨ = ( join ‘ 𝐾 )
3 cdlemg35.m ⊢ ∧ = ( meet ‘ 𝐾 )
4 cdlemg35.a ⊢ 𝐴 = ( Atoms ‘ 𝐾 )
5 cdlemg35.h ⊢ 𝐻 = ( LHyp ‘ 𝐾 )
6 cdlemg35.t ⊢ 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
7 id ⊢ ( 𝑃 = 𝑄 → 𝑃 = 𝑄 )
8 2fveq3 ⊢ ( 𝑃 = 𝑄 → ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) = ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) )
9 7 8 oveq12d ⊢ ( 𝑃 = 𝑄 → ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) = ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) )
10 9 oveq1d ⊢ ( 𝑃 = 𝑄 → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )
11 10 adantl ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 = 𝑄 ) → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )
12 simpl1 ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
13 simpl2 ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) )
14 simpl3l ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → 𝐹 ∈ 𝑇 )
15 simpl3r ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → 𝐺 ∈ 𝑇 )
16 simpr ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → 𝑃 ≠ 𝑄 )
17 eqid ⊢ ( ( trL ‘ 𝐾 ) ‘ 𝑊 ) = ( ( trL ‘ 𝐾 ) ‘ 𝑊 )
18 1 2 3 4 5 6 17 cdlemg39 ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ) ) → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )
19 12 13 14 15 16 18 syl113anc ⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) ∧ 𝑃 ≠ 𝑄 ) → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )
20 11 19 pm2.61dane ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ) ) → ( ( 𝑃 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑃 ) ) ) ∧ 𝑊 ) = ( ( 𝑄 ∨ ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) ) ∧ 𝑊 ) )