Metamath Proof Explorer


Theorem cdlemg2cN

Description: Any translation belongs to the set of functions constructed for cdleme . TODO: Fix comment. (Contributed by NM, 22-Apr-2013) (New usage is discouraged.)

Ref Expression
Hypotheses cdlemg2.b 𝐵 = ( Base ‘ 𝐾 )
cdlemg2.l = ( le ‘ 𝐾 )
cdlemg2.j = ( join ‘ 𝐾 )
cdlemg2.m = ( meet ‘ 𝐾 )
cdlemg2.a 𝐴 = ( Atoms ‘ 𝐾 )
cdlemg2.h 𝐻 = ( LHyp ‘ 𝐾 )
cdlemg2.t 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
cdlemg2.u 𝑈 = ( ( 𝑃 𝑄 ) 𝑊 )
cdlemg2.d 𝐷 = ( ( 𝑡 𝑈 ) ( 𝑄 ( ( 𝑃 𝑡 ) 𝑊 ) ) )
cdlemg2.e 𝐸 = ( ( 𝑃 𝑄 ) ( 𝐷 ( ( 𝑠 𝑡 ) 𝑊 ) ) )
cdlemg2.g 𝐺 = ( 𝑥𝐵 ↦ if ( ( 𝑃𝑄 ∧ ¬ 𝑥 𝑊 ) , ( 𝑧𝐵𝑠𝐴 ( ( ¬ 𝑠 𝑊 ∧ ( 𝑠 ( 𝑥 𝑊 ) ) = 𝑥 ) → 𝑧 = ( if ( 𝑠 ( 𝑃 𝑄 ) , ( 𝑦𝐵𝑡𝐴 ( ( ¬ 𝑡 𝑊 ∧ ¬ 𝑡 ( 𝑃 𝑄 ) ) → 𝑦 = 𝐸 ) ) , 𝑠 / 𝑡 𝐷 ) ( 𝑥 𝑊 ) ) ) ) , 𝑥 ) )
Assertion cdlemg2cN ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) ∧ ( 𝐹𝑃 ) = 𝑄 ) → ( 𝐹𝑇𝐹 = 𝐺 ) )

Proof

Step Hyp Ref Expression
1 cdlemg2.b 𝐵 = ( Base ‘ 𝐾 )
2 cdlemg2.l = ( le ‘ 𝐾 )
3 cdlemg2.j = ( join ‘ 𝐾 )
4 cdlemg2.m = ( meet ‘ 𝐾 )
5 cdlemg2.a 𝐴 = ( Atoms ‘ 𝐾 )
6 cdlemg2.h 𝐻 = ( LHyp ‘ 𝐾 )
7 cdlemg2.t 𝑇 = ( ( LTrn ‘ 𝐾 ) ‘ 𝑊 )
8 cdlemg2.u 𝑈 = ( ( 𝑃 𝑄 ) 𝑊 )
9 cdlemg2.d 𝐷 = ( ( 𝑡 𝑈 ) ( 𝑄 ( ( 𝑃 𝑡 ) 𝑊 ) ) )
10 cdlemg2.e 𝐸 = ( ( 𝑃 𝑄 ) ( 𝐷 ( ( 𝑠 𝑡 ) 𝑊 ) ) )
11 cdlemg2.g 𝐺 = ( 𝑥𝐵 ↦ if ( ( 𝑃𝑄 ∧ ¬ 𝑥 𝑊 ) , ( 𝑧𝐵𝑠𝐴 ( ( ¬ 𝑠 𝑊 ∧ ( 𝑠 ( 𝑥 𝑊 ) ) = 𝑥 ) → 𝑧 = ( if ( 𝑠 ( 𝑃 𝑄 ) , ( 𝑦𝐵𝑡𝐴 ( ( ¬ 𝑡 𝑊 ∧ ¬ 𝑡 ( 𝑃 𝑄 ) ) → 𝑦 = 𝐸 ) ) , 𝑠 / 𝑡 𝐷 ) ( 𝑥 𝑊 ) ) ) ) , 𝑥 ) )
12 2 5 6 7 cdlemg1cN ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) ∧ ( 𝐹𝑃 ) = 𝑄 ) → ( 𝐹𝑇𝐹 = ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 ) ) )
13 eqid ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 ) = ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 )
14 1 2 3 4 5 6 8 9 10 11 7 13 cdlemg1b2 ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) → ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 ) = 𝐺 )
15 14 adantr ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) ∧ ( 𝐹𝑃 ) = 𝑄 ) → ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 ) = 𝐺 )
16 15 eqeq2d ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) ∧ ( 𝐹𝑃 ) = 𝑄 ) → ( 𝐹 = ( 𝑓𝑇 ( 𝑓𝑃 ) = 𝑄 ) ↔ 𝐹 = 𝐺 ) )
17 12 16 bitrd ( ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑃𝐴 ∧ ¬ 𝑃 𝑊 ) ∧ ( 𝑄𝐴 ∧ ¬ 𝑄 𝑊 ) ) ∧ ( 𝐹𝑃 ) = 𝑄 ) → ( 𝐹𝑇𝐹 = 𝐺 ) )