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 29465

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 2850	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ (V × V) ↔ 𝐺 ∈ (V × V)))
2		fveq2 6882	. . . 4 ⊢ (𝑔 = 𝐺 → (1^st ‘𝑔) = (1^st ‘𝐺))
3		fveq2 6882	. . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4	1, 2, 3	ifbieq12d 4514	. . 3 ⊢ (𝑔 = 𝐺 → if(𝑔 ∈ (V × V), (1^st ‘𝑔), (Base‘𝑔)) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)))
5		df-vtx 29463	. . 3 ⊢ Vtx = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (1^st ‘𝑔), (Base‘𝑔)))
6		fvex 6895	. . . 4 ⊢ (1^st ‘𝐺) ∈ V
7		fvex 6895	. . . 4 ⊢ (Base‘𝐺) ∈ V
8	6, 7	ifex 4536	. . 3 ⊢ if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)) ∈ V
9	4, 5, 8	fvmpt 6990	. 2 ⊢ (𝐺 ∈ V → (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)))
10		fvprc 6874	. . 3 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
11		prcnel 3478	. . . 4 ⊢ (¬ 𝐺 ∈ V → ¬ 𝐺 ∈ (V × V))
12	11	iffalsed 4496	. . 3 ⊢ (¬ 𝐺 ∈ V → if(𝐺 ∈ (V × V), (1^st ‘𝐺), (Base‘𝐺)) = (Base‘𝐺))
13		fvprc 6874	. . 3 ⊢ (¬ 𝐺 ∈ V → (Vtx‘𝐺) = ∅)
14	10, 12, 13	3eqtr4rd 2808	. 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 2145 Vcvv 3453 ∅c0 4282 ifcif 4485 × cxp 5657 ‘cfv 6537 1^st c1st 7988 Basecbs 17307 Vtxcvtx 29461

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-vtx 29463

This theorem is used by: opvtxval 29468 funvtxdmge2val 29476 funvtxdm2val 29478 snstrvtxval 29502 vtxval0 29504

W3C validator