Theorem cdlemg17irq

Description: cdlemg17ir with P and Q swapped. (Contributed by NM, 13-May-2013)

	Ref	Expression
Hypotheses	cdlemg12.l	⊢ ≤ = ( le ‘ 𝐾 )
	cdlemg12.j	⊢ ∨ = ( join ‘ 𝐾 )
	cdlemg12.m	⊢ ∧ = ( meet ‘ 𝐾 )
	cdlemg12.a	⊢ 𝐴 = ( Atoms ‘ 𝐾 )
	cdlemg12.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
	cdlemg12.t	⊢ 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
	cdlemg12b.r	⊢ 𝑅 = ( ( trL ‘ 𝐾 ) ‘ 𝑊 )
Assertion	cdlemg17irq	⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ) ∧ ( ( 𝐺 ‘ 𝑃 ) ≠ 𝑃 ∧ ( 𝑅 ‘ 𝐺 ) ≤ ( 𝑃 ∨ 𝑄 ) ∧ ¬ ∃ 𝑟 ∈ 𝐴 ( ¬ 𝑟 ≤ 𝑊 ∧ ( 𝑃 ∨ 𝑟 ) = ( 𝑄 ∨ 𝑟 ) ) ) ) → ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) = ( 𝐹 ‘ 𝑃 ) )

Proof

Step	Hyp	Ref	Expression
1		cdlemg12.l	⊢ ≤ = ( le ‘ 𝐾 )
2		cdlemg12.j	⊢ ∨ = ( join ‘ 𝐾 )
3		cdlemg12.m	⊢ ∧ = ( meet ‘ 𝐾 )
4		cdlemg12.a	⊢ 𝐴 = ( Atoms ‘ 𝐾 )
5		cdlemg12.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
6		cdlemg12.t	⊢ 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
7		cdlemg12b.r	⊢ 𝑅 = ( ( trL ‘ 𝐾 ) ‘ 𝑊 )
8	1 2 3 4 5 6 7	cdlemg17pq	⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ) ∧ ( ( 𝐺 ‘ 𝑃 ) ≠ 𝑃 ∧ ( 𝑅 ‘ 𝐺 ) ≤ ( 𝑃 ∨ 𝑄 ) ∧ ¬ ∃ 𝑟 ∈ 𝐴 ( ¬ 𝑟 ≤ 𝑊 ∧ ( 𝑃 ∨ 𝑟 ) = ( 𝑄 ∨ 𝑟 ) ) ) ) → ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃 ) ∧ ( ( 𝐺 ‘ 𝑄 ) ≠ 𝑄 ∧ ( 𝑅 ‘ 𝐺 ) ≤ ( 𝑄 ∨ 𝑃 ) ∧ ¬ ∃ 𝑟 ∈ 𝐴 ( ¬ 𝑟 ≤ 𝑊 ∧ ( 𝑄 ∨ 𝑟 ) = ( 𝑃 ∨ 𝑟 ) ) ) ) )
9	1 2 3 4 5 6 7	cdlemg17ir	⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃 ) ∧ ( ( 𝐺 ‘ 𝑄 ) ≠ 𝑄 ∧ ( 𝑅 ‘ 𝐺 ) ≤ ( 𝑄 ∨ 𝑃 ) ∧ ¬ ∃ 𝑟 ∈ 𝐴 ( ¬ 𝑟 ≤ 𝑊 ∧ ( 𝑄 ∨ 𝑟 ) = ( 𝑃 ∨ 𝑟 ) ) ) ) → ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) = ( 𝐹 ‘ 𝑃 ) )
10	8 9	syl	⊢ ( ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) ∧ ( 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ) ∧ ( ( 𝐺 ‘ 𝑃 ) ≠ 𝑃 ∧ ( 𝑅 ‘ 𝐺 ) ≤ ( 𝑃 ∨ 𝑄 ) ∧ ¬ ∃ 𝑟 ∈ 𝐴 ( ¬ 𝑟 ≤ 𝑊 ∧ ( 𝑃 ∨ 𝑟 ) = ( 𝑄 ∨ 𝑟 ) ) ) ) → ( 𝐹 ‘ ( 𝐺 ‘ 𝑄 ) ) = ( 𝐹 ‘ 𝑃 ) )