Theorem grimidvtxedg 48383

Description: The identity relation restricted to the set of vertices of a graph is a graph isomorphism between the graph and a graph with the same vertices and edges. (Contributed by AV, 4-May-2025.)

Hypotheses

Ref	Expression
grimidvtxsdg.g	⊢ (𝜑 → 𝐺 ∈ UHGraph)
grimidvtxsdg.h	⊢ (𝜑 → 𝐻 ∈ 𝑉)
grimidvtxsdg.v	⊢ (𝜑 → (Vtx‘𝐺) = (Vtx‘𝐻))
grimidvtxsdg.e	⊢ (𝜑 → (iEdg‘𝐺) = (iEdg‘𝐻))

Assertion

Ref	Expression
grimidvtxedg	⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)) ∈ (𝐺 GraphIso 𝐻))

Proof of Theorem grimidvtxedg

Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1oi 6812	. . 3 ⊢ ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺)
2		grimidvtxsdg.v	. . . 4 ⊢ (𝜑 → (Vtx‘𝐺) = (Vtx‘𝐻))
3	2	f1oeq3d 6771	. . 3 ⊢ (𝜑 → (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ↔ ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻)))
4	1, 3	mpbii 234	. 2 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5		funi 6524	. . . . 5 ⊢ Fun I
6		fvex 6847	. . . . . 6 ⊢ (iEdg‘𝐺) ∈ V
7	6	dmex 7856	. . . . 5 ⊢ dom (iEdg‘𝐺) ∈ V
8		resfunexg 7166	. . . . 5 ⊢ ((Fun I ∧ dom (iEdg‘𝐺) ∈ V) → ( I ↾ dom (iEdg‘𝐺)) ∈ V)
9	5, 7, 8	mp2an 698	. . . 4 ⊢ ( I ↾ dom (iEdg‘𝐺)) ∈ V
10	9	a1i 11	. . 3 ⊢ (𝜑 → ( I ↾ dom (iEdg‘𝐺)) ∈ V)
11		f1oi 6812	. . . . 5 ⊢ ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐺)
12		grimidvtxsdg.e	. . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = (iEdg‘𝐻))
13	12	dmeqd 5854	. . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom (iEdg‘𝐻))
14	13	f1oeq3d 6771	. . . . 5 ⊢ (𝜑 → (( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐺) ↔ ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
15	11, 14	mpbii 234	. . . 4 ⊢ (𝜑 → ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻))
16		fvresi 7124	. . . . . . . 8 ⊢ (𝑖 ∈ dom (iEdg‘𝐺) → (( I ↾ dom (iEdg‘𝐺))‘𝑖) = 𝑖)
17	16	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ dom (iEdg‘𝐺))‘𝑖) = 𝑖)
18	17	fveq2d 6838	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
19	12	eqcomd 2746	. . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺))
20	19	fveq1d 6836	. . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)))
21	20	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)))
22		grimidvtxsdg.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
23		eqid 2740	. . . . . . . . 9 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
24		eqid 2740	. . . . . . . . 9 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
25	23, 24	uhgrss 29158	. . . . . . . 8 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺))
26	22, 25	sylan 586	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺))
27		resiima 6035	. . . . . . 7 ⊢ (((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺) → (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
28	26, 27	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
29	18, 21, 28	3eqtr4d 2785	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)))
30	29	ralrimiva 3132	. . . 4 ⊢ (𝜑 → ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)))
31	15, 30	jca 516	. . 3 ⊢ (𝜑 → (( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
32		f1oeq1 6762	. . . 4 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
33		fveq1 6833	. . . . . 6 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (𝑗‘𝑖) = (( I ↾ dom (iEdg‘𝐺))‘𝑖))
34	33	fveqeq2d 6842	. . . . 5 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) ↔ ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
35	34	ralbidv 3163	. . . 4 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
36	32, 35	anbi12d 638	. . 3 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → ((𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))) ↔ (( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)))))
37	10, 31, 36	spcedv 3543	. 2 ⊢ (𝜑 → ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
38		grimidvtxsdg.h	. . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑉)
39		fvex 6847	. . . . 5 ⊢ (Vtx‘𝐺) ∈ V
40		resfunexg 7166	. . . . 5 ⊢ ((Fun I ∧ (Vtx‘𝐺) ∈ V) → ( I ↾ (Vtx‘𝐺)) ∈ V)
41	5, 39, 40	mp2an 698	. . . 4 ⊢ ( I ↾ (Vtx‘𝐺)) ∈ V
42	41	a1i 11	. . 3 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)) ∈ V)
43		eqid 2740	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
44		eqid 2740	. . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
45	23, 43, 24, 44	isgrim 48380	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ 𝑉 ∧ ( I ↾ (Vtx‘𝐺)) ∈ V) → (( I ↾ (Vtx‘𝐺)) ∈ (𝐺 GraphIso 𝐻) ↔ (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))))
46	22, 38, 42, 45	syl3anc 1379	. 2 ⊢ (𝜑 → (( I ↾ (Vtx‘𝐺)) ∈ (𝐺 GraphIso 𝐻) ↔ (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))))
47	4, 37, 46	mpbir2and 719	1 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)) ∈ (𝐺 GraphIso 𝐻))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119  ∀wral 3054  Vcvv 3432   ⊆ wss 3890   I cid 5519  dom cdm 5625   ↾ cres 5627   “ cima 5628  Fun wfun 6486  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7363  Vtxcvtx 29090  iEdgciedg 29091  UHGraphcuhgr 29150   GraphIso cgrim 48373

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-map 8772  df-uhgr 29152  df-grim 48376

This theorem is referenced by:  grimid  48384  opstrgric  48424