vtxval - Metamath Proof Explorer

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

Theorem vtxval 29387

Description: The set of vertices of a graph. (Contributed by AV, 9-Jan-2020.) (Revised by AV, 21-Sep-2020.)

**Assertion**
Ref	Expression
vtxval	⊢ (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺))

Proof of Theorem vtxval Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2854	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ (V × V) ↔ 𝐺 ∈ (V × V)))
2		fveq2 6888	. . . 4 ⊢ (𝑔 = 𝐺 → (1^st ‘𝑔) = (1^st ‘𝐺))
3		fveq2 6888	. . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4	1, 2, 3	ifbieq12d 4521	. . 3 ⊢ (𝑔 = 𝐺 → if(𝑔 ∈ (V × V), (1^st ‘𝑔), (Base‘𝑔)) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)))
5		df-vtx 29385	. . 3 ⊢ Vtx = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (1^st ‘𝑔), (Base‘𝑔)))
6		fvex 6901	. . . 4 ⊢ (1^st ‘𝐺) ∈ V
7		fvex 6901	. . . 4 ⊢ (Base‘𝐺) ∈ V
8	6, 7	ifex 4543	. . 3 ⊢ if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)) ∈ V
9	4, 5, 8	fvmpt 6996	. 2 ⊢ (𝐺 ∈ V → (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)))
10		fvprc 6880	. . 3 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
11		prcnel 3483	. . . 4 ⊢ (¬ 𝐺 ∈ V → ¬ 𝐺 ∈ (V × V))
12	11	iffalsed 4503	. . 3 ⊢ (¬ 𝐺 ∈ V → if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)) = (Base‘𝐺))
13		fvprc 6880	. . 3 ⊢ (¬ 𝐺 ∈ V → (Vtx‘𝐺) = ∅)
14	10, 12, 13	3eqtr4rd 2812	. 2 ⊢ (¬ 𝐺 ∈ V → (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)))
15	9, 14	pm2.61i 184	1 ⊢ (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ∅c0 4289 ifcif 4492 × cxp 5664 ‘cfv 6543 1^st c1st 7993 Basecbs 17294 Vtxcvtx 29383

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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409

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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-vtx 29385

This theorem is used by: opvtxval 29390 funvtxdmge2val 29398 funvtxdm2val 29400 snstrvtxval 29424 vtxval0 29426

W3C validator