mapdh8j

Description: Part of Part (8) in Baer p. 48. (Contributed by NM, 13-May-2015)

	Ref	Expression
Hypotheses	mapdh8a.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
	mapdh8a.u	⊢ 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
	mapdh8a.v	⊢ 𝑉 = ( Base ‘ 𝑈 )
	mapdh8a.s	⊢ − = ( -_g ‘ 𝑈 )
	mapdh8a.o	⊢ 0 = ( 0_g ‘ 𝑈 )
	mapdh8a.n	⊢ 𝑁 = ( LSpan ‘ 𝑈 )
	mapdh8a.c	⊢ 𝐶 = ( ( LCDual ‘ 𝐾 ) ‘ 𝑊 )
	mapdh8a.d	⊢ 𝐷 = ( Base ‘ 𝐶 )
	mapdh8a.r	⊢ 𝑅 = ( -_g ‘ 𝐶 )
	mapdh8a.q	⊢ 𝑄 = ( 0_g ‘ 𝐶 )
	mapdh8a.j	⊢ 𝐽 = ( LSpan ‘ 𝐶 )
	mapdh8a.m	⊢ 𝑀 = ( ( mapd ‘ 𝐾 ) ‘ 𝑊 )
	mapdh8a.i	⊢ 𝐼 = ( 𝑥 ∈ V ↦ if ( ( 2^nd ‘ 𝑥 ) = 0 , 𝑄 , ( ℩ ℎ ∈ 𝐷 ( ( 𝑀 ‘ ( 𝑁 ‘ { ( 2^nd ‘ 𝑥 ) } ) ) = ( 𝐽 ‘ { ℎ } ) ∧ ( 𝑀 ‘ ( 𝑁 ‘ { ( ( 1^st ‘ ( 1^st ‘ 𝑥 ) ) − ( 2^nd ‘ 𝑥 ) ) } ) ) = ( 𝐽 ‘ { ( ( 2^nd ‘ ( 1^st ‘ 𝑥 ) ) 𝑅 ℎ ) } ) ) ) ) )
	mapdh8a.k	⊢ ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
	mapdh8h.f	⊢ ( 𝜑 → 𝐹 ∈ 𝐷 )
	mapdh8h.mn	⊢ ( 𝜑 → ( 𝑀 ‘ ( 𝑁 ‘ { 𝑋 } ) ) = ( 𝐽 ‘ { 𝐹 } ) )
	mapdh8i.x	⊢ ( 𝜑 → 𝑋 ∈ ( 𝑉 ∖ { 0 } ) )
	mapdh8i.y	⊢ ( 𝜑 → 𝑌 ∈ ( 𝑉 ∖ { 0 } ) )
	mapdh8i.z	⊢ ( 𝜑 → 𝑍 ∈ ( 𝑉 ∖ { 0 } ) )
	mapdh8i.xy	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑌 } ) )
	mapdh8i.xz	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑍 } ) )
	mapdh8i.yt	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑌 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
	mapdh8i.zt	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑍 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
	mapdh8j.t	⊢ ( 𝜑 → 𝑇 ∈ ( 𝑉 ∖ { 0 } ) )
Assertion	mapdh8j	⊢ ( 𝜑 → ( 𝐼 ‘ ⟨ 𝑌 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) , 𝑇 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑍 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) , 𝑇 ⟩ ) )

Proof

Step	Hyp	Ref	Expression
1		mapdh8a.h	⊢ 𝐻 = ( LHyp ‘ 𝐾 )
2		mapdh8a.u	⊢ 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
3		mapdh8a.v	⊢ 𝑉 = ( Base ‘ 𝑈 )
4		mapdh8a.s	⊢ − = ( -_g ‘ 𝑈 )
5		mapdh8a.o	⊢ 0 = ( 0_g ‘ 𝑈 )
6		mapdh8a.n	⊢ 𝑁 = ( LSpan ‘ 𝑈 )
7		mapdh8a.c	⊢ 𝐶 = ( ( LCDual ‘ 𝐾 ) ‘ 𝑊 )
8		mapdh8a.d	⊢ 𝐷 = ( Base ‘ 𝐶 )
9		mapdh8a.r	⊢ 𝑅 = ( -_g ‘ 𝐶 )
10		mapdh8a.q	⊢ 𝑄 = ( 0_g ‘ 𝐶 )
11		mapdh8a.j	⊢ 𝐽 = ( LSpan ‘ 𝐶 )
12		mapdh8a.m	⊢ 𝑀 = ( ( mapd ‘ 𝐾 ) ‘ 𝑊 )
13		mapdh8a.i	⊢ 𝐼 = ( 𝑥 ∈ V ↦ if ( ( 2^nd ‘ 𝑥 ) = 0 , 𝑄 , ( ℩ ℎ ∈ 𝐷 ( ( 𝑀 ‘ ( 𝑁 ‘ { ( 2^nd ‘ 𝑥 ) } ) ) = ( 𝐽 ‘ { ℎ } ) ∧ ( 𝑀 ‘ ( 𝑁 ‘ { ( ( 1^st ‘ ( 1^st ‘ 𝑥 ) ) − ( 2^nd ‘ 𝑥 ) ) } ) ) = ( 𝐽 ‘ { ( ( 2^nd ‘ ( 1^st ‘ 𝑥 ) ) 𝑅 ℎ ) } ) ) ) ) )
14		mapdh8a.k	⊢ ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
15		mapdh8h.f	⊢ ( 𝜑 → 𝐹 ∈ 𝐷 )
16		mapdh8h.mn	⊢ ( 𝜑 → ( 𝑀 ‘ ( 𝑁 ‘ { 𝑋 } ) ) = ( 𝐽 ‘ { 𝐹 } ) )
17		mapdh8i.x	⊢ ( 𝜑 → 𝑋 ∈ ( 𝑉 ∖ { 0 } ) )
18		mapdh8i.y	⊢ ( 𝜑 → 𝑌 ∈ ( 𝑉 ∖ { 0 } ) )
19		mapdh8i.z	⊢ ( 𝜑 → 𝑍 ∈ ( 𝑉 ∖ { 0 } ) )
20		mapdh8i.xy	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑌 } ) )
21		mapdh8i.xz	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑍 } ) )
22		mapdh8i.yt	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑌 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
23		mapdh8i.zt	⊢ ( 𝜑 → ( 𝑁 ‘ { 𝑍 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
24		mapdh8j.t	⊢ ( 𝜑 → 𝑇 ∈ ( 𝑉 ∖ { 0 } ) )
25	14	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
26	15	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → 𝐹 ∈ 𝐷 )
27	16	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑀 ‘ ( 𝑁 ‘ { 𝑋 } ) ) = ( 𝐽 ‘ { 𝐹 } ) )
28		eqidd	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) )
29		eqidd	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) )
30	17	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → 𝑋 ∈ ( 𝑉 ∖ { 0 } ) )
31	18	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → 𝑌 ∈ ( 𝑉 ∖ { 0 } ) )
32	19	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → 𝑍 ∈ ( 𝑉 ∖ { 0 } ) )
33	24	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → 𝑇 ∈ ( 𝑉 ∖ { 0 } ) )
34		simpr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) )
35	20	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑌 } ) )
36	21	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑍 } ) )
37	1 2 3 4 5 6 7 8 9 10 11 12 13 25 26 27 28 29 30 31 32 33 34 35 36	mapdh8ad	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) = ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐼 ‘ ⟨ 𝑌 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) , 𝑇 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑍 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) , 𝑇 ⟩ ) )
38	14	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) )
39	15	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → 𝐹 ∈ 𝐷 )
40	16	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑀 ‘ ( 𝑁 ‘ { 𝑋 } ) ) = ( 𝐽 ‘ { 𝐹 } ) )
41	17	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → 𝑋 ∈ ( 𝑉 ∖ { 0 } ) )
42	18	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → 𝑌 ∈ ( 𝑉 ∖ { 0 } ) )
43	19	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → 𝑍 ∈ ( 𝑉 ∖ { 0 } ) )
44	20	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑌 } ) )
45	21	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑍 } ) )
46	22	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑌 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
47	23	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑍 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
48	24	adantr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → 𝑇 ∈ ( 𝑉 ∖ { 0 } ) )
49		simpr	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) )
50	1 2 3 4 5 6 7 8 9 10 11 12 13 38 39 40 41 42 43 44 45 46 47 48 49	mapdh8i	⊢ ( ( 𝜑 ∧ ( 𝑁 ‘ { 𝑋 } ) ≠ ( 𝑁 ‘ { 𝑇 } ) ) → ( 𝐼 ‘ ⟨ 𝑌 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) , 𝑇 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑍 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) , 𝑇 ⟩ ) )
51	37 50	pm2.61dane	⊢ ( 𝜑 → ( 𝐼 ‘ ⟨ 𝑌 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑌 ⟩ ) , 𝑇 ⟩ ) = ( 𝐼 ‘ ⟨ 𝑍 , ( 𝐼 ‘ ⟨ 𝑋 , 𝐹 , 𝑍 ⟩ ) , 𝑇 ⟩ ) )

Metamath Proof Explorer

Theorem mapdh8j

Proof