Theorem hdmap1val 42168

Description: Value of preliminary map from vectors to functionals in the closed kernel dual space. (Restatement of mapdhval 42094.) TODO: change 𝐼 = (𝑥 ∈ V ↦... to (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌 > ) =... in e.g. mapdh8 42158 to shorten proofs with no $d on 𝑥. (Contributed by NM, 15-May-2015.)

Hypotheses

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

Assertion

Ref	Expression
hdmap1val	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))))

Distinct variable groups:   𝐶,ℎ   𝐷,ℎ   ℎ,𝐽   ℎ,𝑀   ℎ,𝑁   𝑈,ℎ   ℎ,𝑉   ℎ,𝐹   ℎ,𝑋   ℎ,𝑌   𝜑,ℎ

Allowed substitution hints:   𝐴(ℎ)   𝑄(ℎ)   𝑅(ℎ)   𝐻(ℎ)   𝐼(ℎ)   𝐾(ℎ)   − (ℎ)   𝑊(ℎ)   0 (ℎ)

Proof of Theorem hdmap1val

Step	Hyp	Ref	Expression
1		hdmap1val.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
2		hdmap1fval.u	. . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
3		hdmap1fval.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
4		hdmap1fval.s	. . 3 ⊢ − = (-g‘𝑈)
5		hdmap1fval.o	. . 3 ⊢ 0 = (0g‘𝑈)
6		hdmap1fval.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑈)
7		hdmap1fval.c	. . 3 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
8		hdmap1fval.d	. . 3 ⊢ 𝐷 = (Base‘𝐶)
9		hdmap1fval.r	. . 3 ⊢ 𝑅 = (-g‘𝐶)
10		hdmap1fval.q	. . 3 ⊢ 𝑄 = (0g‘𝐶)
11		hdmap1fval.j	. . 3 ⊢ 𝐽 = (LSpan‘𝐶)
12		hdmap1fval.m	. . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
13		hdmap1fval.i	. . 3 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊)
14		hdmap1fval.k	. . 3 ⊢ (𝜑 → (𝐾 ∈ 𝐴 ∧ 𝑊 ∈ 𝐻))
15		df-ot 4591	. . . 4 ⊢ ⟨𝑋, 𝐹, 𝑌⟩ = ⟨⟨𝑋, 𝐹⟩, 𝑌⟩
16		hdmap1val.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
17		hdmap1val.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
18		opelxp 5668	. . . . . 6 ⊢ (⟨𝑋, 𝐹⟩ ∈ (𝑉 × 𝐷) ↔ (𝑋 ∈ 𝑉 ∧ 𝐹 ∈ 𝐷))
19	16, 17, 18	sylanbrc 584	. . . . 5 ⊢ (𝜑 → ⟨𝑋, 𝐹⟩ ∈ (𝑉 × 𝐷))
20		hdmap1val.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
21		opelxp 5668	. . . . 5 ⊢ (⟨⟨𝑋, 𝐹⟩, 𝑌⟩ ∈ ((𝑉 × 𝐷) × 𝑉) ↔ (⟨𝑋, 𝐹⟩ ∈ (𝑉 × 𝐷) ∧ 𝑌 ∈ 𝑉))
22	19, 20, 21	sylanbrc 584	. . . 4 ⊢ (𝜑 → ⟨⟨𝑋, 𝐹⟩, 𝑌⟩ ∈ ((𝑉 × 𝐷) × 𝑉))
23	15, 22	eqeltrid 2841	. . 3 ⊢ (𝜑 → ⟨𝑋, 𝐹, 𝑌⟩ ∈ ((𝑉 × 𝐷) × 𝑉))
24	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 23	hdmap1vallem 42167	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)})))))
25		ot3rdg 7959	. . . . 5 ⊢ (𝑌 ∈ 𝑉 → (2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 𝑌)
26	20, 25	syl 17	. . . 4 ⊢ (𝜑 → (2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 𝑌)
27	26	eqeq1d 2739	. . 3 ⊢ (𝜑 → ((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 ↔ 𝑌 = 0 ))
28	26	sneqd 4594	. . . . . . 7 ⊢ (𝜑 → {(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)} = {𝑌})
29	28	fveq2d 6846	. . . . . 6 ⊢ (𝜑 → (𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)}) = (𝑁‘{𝑌}))
30	29	fveqeq2d 6850	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{ℎ}) ↔ (𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ})))
31		ot1stg 7957	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹 ∈ 𝐷 ∧ 𝑌 ∈ 𝑉) → (1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝑋)
32	16, 17, 20, 31	syl3anc 1374	. . . . . . . . . 10 ⊢ (𝜑 → (1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝑋)
33	32, 26	oveq12d 7386	. . . . . . . . 9 ⊢ (𝜑 → ((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩)) = (𝑋 − 𝑌))
34	33	sneqd 4594	. . . . . . . 8 ⊢ (𝜑 → {((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))} = {(𝑋 − 𝑌)})
35	34	fveq2d 6846	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))}) = (𝑁‘{(𝑋 − 𝑌)}))
36	35	fveq2d 6846	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝑀‘(𝑁‘{(𝑋 − 𝑌)})))
37		ot2ndg 7958	. . . . . . . . . 10 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹 ∈ 𝐷 ∧ 𝑌 ∈ 𝑉) → (2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝐹)
38	16, 17, 20, 37	syl3anc 1374	. . . . . . . . 9 ⊢ (𝜑 → (2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝐹)
39	38	oveq1d 7383	. . . . . . . 8 ⊢ (𝜑 → ((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ) = (𝐹𝑅ℎ))
40	39	sneqd 4594	. . . . . . 7 ⊢ (𝜑 → {((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)} = {(𝐹𝑅ℎ)})
41	40	fveq2d 6846	. . . . . 6 ⊢ (𝜑 → (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)}) = (𝐽‘{(𝐹𝑅ℎ)}))
42	36, 41	eqeq12d 2753	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)}) ↔ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))
43	30, 42	anbi12d 633	. . . 4 ⊢ (𝜑 → (((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)})) ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))
44	43	riotabidv 7327	. . 3 ⊢ (𝜑 → (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)}))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))
45	27, 44	ifbieq2d 4508	. 2 ⊢ (𝜑 → if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) − (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅ℎ)})))) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))))
46	24, 45	eqtrd 2772	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ifcif 4481  {csn 4582  ⟨cop 4588  ⟨cotp 4590   × cxp 5630  ‘cfv 6500  ℩crio 7324  (class class class)co 7368  1^st c1st 7941  2^nd c2nd 7942  Basecbs 17148  0_gc0g 17371  -_gcsg 18877  LSpanclspn 20934  LHypclh 40354  DVecHcdvh 41448  LCDualclcd 41956  mapdcmpd 41994  HDMap1chdma1 42161

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-1st 7943  df-2nd 7944  df-hdmap1 42163

This theorem is referenced by:  hdmap1val0  42169  hdmap1val2  42170  hdmap1valc  42173