Metamath Proof Explorer


Theorem cdlemk19y

Description: cdlemk19 with simpler hypotheses. TODO: Clean all this up. (Contributed by NM, 30-Jul-2013)

Ref Expression
Hypotheses cdlemk5.b 𝐵 = ( Base ‘ 𝐾 )
cdlemk5.l = ( le ‘ 𝐾 )
cdlemk5.j = ( join ‘ 𝐾 )
cdlemk5.m = ( meet ‘ 𝐾 )
cdlemk5.a 𝐴 = ( Atoms ‘ 𝐾 )
cdlemk5.h 𝐻 = ( LHyp ‘ 𝐾 )
cdlemk5.t 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
cdlemk5.r 𝑅 = ( ( trL ‘ 𝐾 ) ‘ 𝑊 )
cdlemk5.z 𝑍 = ( ( 𝑃 ( 𝑅𝑏 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑏 𝐹 ) ) ) )
cdlemk5.y 𝑌 = ( ( 𝑃 ( 𝑅𝑔 ) ) ( 𝑍 ( 𝑅 ‘ ( 𝑔 𝑏 ) ) ) )
Assertion cdlemk19y ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝐹𝑇𝐹 ≠ ( I ↾ 𝐵 ) ) ) ∧ ( 𝑁𝑇 ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑅𝐹 ) = ( 𝑅𝑁 ) ) ∧ ( 𝑏𝑇 ∧ ( 𝑏 ≠ ( I ↾ 𝐵 ) ∧ ( 𝑅𝑏 ) ≠ ( 𝑅𝐹 ) ) ) ) → 𝐹 / 𝑔 𝑌 = ( 𝑁𝑃 ) )

Proof

Step Hyp Ref Expression
1 cdlemk5.b 𝐵 = ( Base ‘ 𝐾 )
2 cdlemk5.l = ( le ‘ 𝐾 )
3 cdlemk5.j = ( join ‘ 𝐾 )
4 cdlemk5.m = ( meet ‘ 𝐾 )
5 cdlemk5.a 𝐴 = ( Atoms ‘ 𝐾 )
6 cdlemk5.h 𝐻 = ( LHyp ‘ 𝐾 )
7 cdlemk5.t 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
8 cdlemk5.r 𝑅 = ( ( trL ‘ 𝐾 ) ‘ 𝑊 )
9 cdlemk5.z 𝑍 = ( ( 𝑃 ( 𝑅𝑏 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑏 𝐹 ) ) ) )
10 cdlemk5.y 𝑌 = ( ( 𝑃 ( 𝑅𝑔 ) ) ( 𝑍 ( 𝑅 ‘ ( 𝑔 𝑏 ) ) ) )
11 eqid ( 𝑓𝑇 ↦ ( 𝑖𝑇 ( 𝑖𝑃 ) = ( ( 𝑃 ( 𝑅𝑓 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑓 𝐹 ) ) ) ) ) ) = ( 𝑓𝑇 ↦ ( 𝑖𝑇 ( 𝑖𝑃 ) = ( ( 𝑃 ( 𝑅𝑓 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑓 𝐹 ) ) ) ) ) )
12 eqid ( 𝑒𝑇 ↦ ( 𝑗𝑇 ( 𝑗𝑃 ) = ( ( 𝑃 ( 𝑅𝑒 ) ) ( ( ( ( 𝑓𝑇 ↦ ( 𝑖𝑇 ( 𝑖𝑃 ) = ( ( 𝑃 ( 𝑅𝑓 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑓 𝐹 ) ) ) ) ) ) ‘ 𝑏 ) ‘ 𝑃 ) ( 𝑅 ‘ ( 𝑒 𝑏 ) ) ) ) ) ) = ( 𝑒𝑇 ↦ ( 𝑗𝑇 ( 𝑗𝑃 ) = ( ( 𝑃 ( 𝑅𝑒 ) ) ( ( ( ( 𝑓𝑇 ↦ ( 𝑖𝑇 ( 𝑖𝑃 ) = ( ( 𝑃 ( 𝑅𝑓 ) ) ( ( 𝑁𝑃 ) ( 𝑅 ‘ ( 𝑓 𝐹 ) ) ) ) ) ) ‘ 𝑏 ) ‘ 𝑃 ) ( 𝑅 ‘ ( 𝑒 𝑏 ) ) ) ) ) )
13 1 2 3 4 5 6 7 8 9 10 11 12 cdlemk19ylem ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝐹𝑇𝐹 ≠ ( I ↾ 𝐵 ) ) ) ∧ ( 𝑁𝑇 ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑅𝐹 ) = ( 𝑅𝑁 ) ) ∧ ( 𝑏𝑇 ∧ ( 𝑏 ≠ ( I ↾ 𝐵 ) ∧ ( 𝑅𝑏 ) ≠ ( 𝑅𝐹 ) ) ) ) → 𝐹 / 𝑔 𝑌 = ( 𝑁𝑃 ) )