0vfval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 0vfval		Structured version Visualization version GIF version

Theorem 0vfval 31254

Description: Value of the function for the zero vector on a normed complex vector space. (Contributed by NM, 24-Apr-2007.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
0vfval.2	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
0vfval.5	⊢ 𝑍 = (0_vec‘𝑈)

**Assertion**
Ref	Expression
0vfval	⊢ (𝑈 ∈ 𝑉 → 𝑍 = (GId‘𝐺))

**Proof of Theorem 0vfval**
Step	Hyp	Ref	Expression
1		elex 3475	. 2 ⊢ (𝑈 ∈ 𝑉 → 𝑈 ∈ V)
2		fo1st 8053	. . . . . . 7 ⊢ 1^st :V⟶ontoV
3		fofn 6826	. . . . . . 7 ⊢ (1^st :V⟶ontoV → 1^st Fn V)
4	2, 3	ax-mp 5	. . . . . 6 ⊢ 1^st Fn V
5		ssv 3937	. . . . . 6 ⊢ ran 1^st ⊆ V
6		fnco 6685	. . . . . 6 ⊢ ((1^st Fn V ∧ 1^st Fn V ∧ ran 1^st ⊆ V) → (1^st ∘ 1^st ) Fn V)
7	4, 4, 5, 6	mp3an 1491	. . . . 5 ⊢ (1^st ∘ 1^st ) Fn V
8		df-va 31243	. . . . . 6 ⊢ +_𝑣 = (1^st ∘ 1^st )
9	8	fneq1i 6664	. . . . 5 ⊢ ( +_𝑣 Fn V ↔ (1^st ∘ 1^st ) Fn V)
10	7, 9	mpbir 234	. . . 4 ⊢ +_𝑣 Fn V
11		fvco2 7011	. . . 4 ⊢ (( +_𝑣 Fn V ∧ 𝑈 ∈ V) → ((GId ∘ +_𝑣 )‘𝑈) = (GId‘( +_𝑣 ‘𝑈)))
12	10, 11	mpan 703	. . 3 ⊢ (𝑈 ∈ V → ((GId ∘ +_𝑣 )‘𝑈) = (GId‘( +_𝑣 ‘𝑈)))
13		0vfval.5	. . . 4 ⊢ 𝑍 = (0_vec‘𝑈)
14		df-0v 31246	. . . . 5 ⊢ 0_vec = (GId ∘ +_𝑣 )
15	14	fveq1i 6915	. . . 4 ⊢ (0_vec‘𝑈) = ((GId ∘ +_𝑣 )‘𝑈)
16	13, 15	eqtri 2786	. . 3 ⊢ 𝑍 = ((GId ∘ +_𝑣 )‘𝑈)
17		0vfval.2	. . . 4 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
18	17	fveq2i 6917	. . 3 ⊢ (GId‘𝐺) = (GId‘( +_𝑣 ‘𝑈))
19	12, 16, 18	3eqtr4g 2823	. 2 ⊢ (𝑈 ∈ V → 𝑍 = (GId‘𝐺))
20	1, 19	syl 18	1 ⊢ (𝑈 ∈ 𝑉 → 𝑍 = (GId‘𝐺))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ran crn 5657 ∘ ccom 5660 Fn wfn 6559 ⟶ontowfo 6562 ‘cfv 6564 1^st c1st 8031 GIdcgi 31138 +_𝑣 cpv 31233 0_veccn0v 31236

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pr 5396 ax-un 7781

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-fo 6570 df-fv 6572 df-1st 8033 df-va 31243 df-0v 31246

This theorem is used by: nvi 31262 nvzcl 31282 nv0rid 31283 nv0lid 31284 nv0 31285 nvsz 31286 nvrinv 31299 nvlinv 31300 hh0v 31816

W3C validator