hdmap1vallem - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > hdmap1vallem		Structured version Visualization version GIF version

Theorem hdmap1vallem 39093

Description: Value of preliminary map from vectors to functionals in the closed kernel dual space. (Contributed by NM, 15-May-2015.)

**Hypotheses**
Ref	Expression
hdmap1val.h	⊢ 𝐻 = (LHyp‘𝐾)
hdmap1fval.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
hdmap1fval.v	⊢ 𝑉 = (Base‘𝑈)
hdmap1fval.s	⊢ − = (-_g‘𝑈)
hdmap1fval.o	⊢ 0 = (0_g‘𝑈)
hdmap1fval.n	⊢ 𝑁 = (LSpan‘𝑈)
hdmap1fval.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
hdmap1fval.d	⊢ 𝐷 = (Base‘𝐶)
hdmap1fval.r	⊢ 𝑅 = (-_g‘𝐶)
hdmap1fval.q	⊢ 𝑄 = (0_g‘𝐶)
hdmap1fval.j	⊢ 𝐽 = (LSpan‘𝐶)
hdmap1fval.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
hdmap1fval.i	⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
hdmap1fval.k	⊢ (𝜑 → (𝐾 ∈ 𝐴 ∧ 𝑊 ∈ 𝐻))
hdmap1val.t	⊢ (𝜑 → 𝑇 ∈ ((𝑉 × 𝐷) × 𝑉))

**Assertion**
Ref	Expression
hdmap1vallem	⊢ (𝜑 → (𝐼‘𝑇) = if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))))

Distinct variable groups: 𝐶,ℎ 𝐷,ℎ ℎ,𝐽 ℎ,𝑀 ℎ,𝑁 𝑈,ℎ ℎ,𝑉 𝑇,ℎ Allowed substitution hints: 𝜑(ℎ) 𝐴(ℎ) 𝑄(ℎ) 𝑅(ℎ) 𝐻(ℎ) 𝐼(ℎ) 𝐾(ℎ) − (ℎ) 𝑊(ℎ) 0 (ℎ)

Proof of Theorem hdmap1vallem Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		hdmap1val.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		hdmap1fval.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		hdmap1fval.v	. . . 4 ⊢ 𝑉 = (Base‘𝑈)
4		hdmap1fval.s	. . . 4 ⊢ − = (-_g‘𝑈)
5		hdmap1fval.o	. . . 4 ⊢ 0 = (0_g‘𝑈)
6		hdmap1fval.n	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
7		hdmap1fval.c	. . . 4 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
8		hdmap1fval.d	. . . 4 ⊢ 𝐷 = (Base‘𝐶)
9		hdmap1fval.r	. . . 4 ⊢ 𝑅 = (-_g‘𝐶)
10		hdmap1fval.q	. . . 4 ⊢ 𝑄 = (0_g‘𝐶)
11		hdmap1fval.j	. . . 4 ⊢ 𝐽 = (LSpan‘𝐶)
12		hdmap1fval.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
13		hdmap1fval.i	. . . 4 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
14		hdmap1fval.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ 𝐴 ∧ 𝑊 ∈ 𝐻))
15	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14	hdmap1fval 39092	. . 3 ⊢ (𝜑 → 𝐼 = (𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)}))))))
16	15	fveq1d 6647	. 2 ⊢ (𝜑 → (𝐼‘𝑇) = ((𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))‘𝑇))
17		hdmap1val.t	. . 3 ⊢ (𝜑 → 𝑇 ∈ ((𝑉 × 𝐷) × 𝑉))
18	10	fvexi 6659	. . . 4 ⊢ 𝑄 ∈ V
19		riotaex 7097	. . . 4 ⊢ (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)}))) ∈ V
20	18, 19	ifex 4473	. . 3 ⊢ if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))) ∈ V
21		fveqeq2 6654	. . . . 5 ⊢ (𝑥 = 𝑇 → ((2^nd ‘𝑥) = 0 ↔ (2^nd ‘𝑇) = 0 ))
22		fveq2 6645	. . . . . . . . . 10 ⊢ (𝑥 = 𝑇 → (2^nd ‘𝑥) = (2^nd ‘𝑇))
23	22	sneqd 4537	. . . . . . . . 9 ⊢ (𝑥 = 𝑇 → {(2^nd ‘𝑥)} = {(2^nd ‘𝑇)})
24	23	fveq2d 6649	. . . . . . . 8 ⊢ (𝑥 = 𝑇 → (𝑁‘{(2^nd ‘𝑥)}) = (𝑁‘{(2^nd ‘𝑇)}))
25	24	fveqeq2d 6653	. . . . . . 7 ⊢ (𝑥 = 𝑇 → ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ↔ (𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ})))
26		2fveq3 6650	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑇 → (1^st ‘(1^st ‘𝑥)) = (1^st ‘(1^st ‘𝑇)))
27	26, 22	oveq12d 7153	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑇 → ((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥)) = ((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇)))
28	27	sneqd 4537	. . . . . . . . . 10 ⊢ (𝑥 = 𝑇 → {((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))} = {((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})
29	28	fveq2d 6649	. . . . . . . . 9 ⊢ (𝑥 = 𝑇 → (𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))}) = (𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))}))
30	29	fveq2d 6649	. . . . . . . 8 ⊢ (𝑥 = 𝑇 → (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})))
31		2fveq3 6650	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑇 → (2^nd ‘(1^st ‘𝑥)) = (2^nd ‘(1^st ‘𝑇)))
32	31	oveq1d 7150	. . . . . . . . . 10 ⊢ (𝑥 = 𝑇 → ((2^nd ‘(1^st ‘𝑥))𝑅ℎ) = ((2^nd ‘(1^st ‘𝑇))𝑅ℎ))
33	32	sneqd 4537	. . . . . . . . 9 ⊢ (𝑥 = 𝑇 → {((2^nd ‘(1^st ‘𝑥))𝑅ℎ)} = {((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})
34	33	fveq2d 6649	. . . . . . . 8 ⊢ (𝑥 = 𝑇 → (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)}) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)}))
35	30, 34	eqeq12d 2814	. . . . . . 7 ⊢ (𝑥 = 𝑇 → ((𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)}) ↔ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))
36	25, 35	anbi12d 633	. . . . . 6 ⊢ (𝑥 = 𝑇 → (((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})) ↔ ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)}))))
37	36	riotabidv 7095	. . . . 5 ⊢ (𝑥 = 𝑇 → (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)}))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)}))))
38	21, 37	ifbieq2d 4450	. . . 4 ⊢ (𝑥 = 𝑇 → if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))) = if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))))
39		eqid 2798	. . . 4 ⊢ (𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)}))))) = (𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
40	38, 39	fvmptg 6743	. . 3 ⊢ ((𝑇 ∈ ((𝑉 × 𝐷) × 𝑉) ∧ if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))) ∈ V) → ((𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))‘𝑇) = if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))))
41	17, 20, 40	sylancl 589	. 2 ⊢ (𝜑 → ((𝑥 ∈ ((𝑉 × 𝐷) × 𝑉) ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))‘𝑇) = if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))))
42	16, 41	eqtrd 2833	1 ⊢ (𝜑 → (𝐼‘𝑇) = if((2^nd ‘𝑇) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑇)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑇)) − (2^nd ‘𝑇))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑇))𝑅ℎ)})))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ifcif 4425 {csn 4525 ↦ cmpt 5110 × cxp 5517 ‘cfv 6324 ℩crio 7092 (class class class)co 7135 1^st c1st 7669 2^nd c2nd 7670 Basecbs 16475 0_gc0g 16705 -_gcsg 18097 LSpanclspn 19736 LHypclh 37280 DVecHcdvh 38374 LCDualclcd 38882 mapdcmpd 38920 HDMap1chdma1 39087

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-hdmap1 39089

This theorem is referenced by: hdmap1val 39094

W3C validator