Theorem grimidvtxedg 47999

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 6809	. . 3 ⊢ ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺)
2		grimidvtxsdg.v	. . . 4 ⊢ (𝜑 → (Vtx‘𝐺) = (Vtx‘𝐻))
3	2	f1oeq3d 6768	. . 3 ⊢ (𝜑 → (( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐺) ↔ ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻)))
4	1, 3	mpbii 233	. 2 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)):(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5		funi 6521	. . . . 5 ⊢ Fun I
6		fvex 6844	. . . . . 6 ⊢ (iEdg‘𝐺) ∈ V
7	6	dmex 7848	. . . . 5 ⊢ dom (iEdg‘𝐺) ∈ V
8		resfunexg 7158	. . . . 5 ⊢ ((Fun I ∧ dom (iEdg‘𝐺) ∈ V) → ( I ↾ dom (iEdg‘𝐺)) ∈ V)
9	5, 7, 8	mp2an 692	. . . 4 ⊢ ( I ↾ dom (iEdg‘𝐺)) ∈ V
10	9	a1i 11	. . 3 ⊢ (𝜑 → ( I ↾ dom (iEdg‘𝐺)) ∈ V)
11		f1oi 6809	. . . . 5 ⊢ ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐺)
12		grimidvtxsdg.e	. . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = (iEdg‘𝐻))
13	12	dmeqd 5852	. . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom (iEdg‘𝐻))
14	13	f1oeq3d 6768	. . . . 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 233	. . . 4 ⊢ (𝜑 → ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻))
16		fvresi 7116	. . . . . . . 8 ⊢ (𝑖 ∈ dom (iEdg‘𝐺) → (( I ↾ dom (iEdg‘𝐺))‘𝑖) = 𝑖)
17	16	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ dom (iEdg‘𝐺))‘𝑖) = 𝑖)
18	17	fveq2d 6835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
19	12	eqcomd 2739	. . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺))
20	19	fveq1d 6833	. . . . . . 7 ⊢ (𝜑 → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)))
21	20	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐺)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)))
22		grimidvtxsdg.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ UHGraph)
23		eqid 2733	. . . . . . . . 9 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
24		eqid 2733	. . . . . . . . 9 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
25	23, 24	uhgrss 29053	. . . . . . . 8 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺))
26	22, 25	sylan 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺))
27		resiima 6032	. . . . . . 7 ⊢ (((iEdg‘𝐺)‘𝑖) ⊆ (Vtx‘𝐺) → (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
28	26, 27	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐺)‘𝑖))
29	18, 21, 28	3eqtr4d 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)))
30	29	ralrimiva 3126	. . . 4 ⊢ (𝜑 → ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)))
31	15, 30	jca 511	. . 3 ⊢ (𝜑 → (( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
32		f1oeq1 6759	. . . 4 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ ( I ↾ dom (iEdg‘𝐺)):dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
33		fveq1 6830	. . . . . 6 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (𝑗‘𝑖) = (( I ↾ dom (iEdg‘𝐺))‘𝑖))
34	33	fveqeq2d 6839	. . . . 5 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) ↔ ((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
35	34	ralbidv 3157	. . . 4 ⊢ (𝑗 = ( I ↾ dom (iEdg‘𝐺)) → (∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(( I ↾ dom (iEdg‘𝐺))‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
36	32, 35	anbi12d 632	. . 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 3550	. 2 ⊢ (𝜑 → ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (( I ↾ (Vtx‘𝐺)) “ ((iEdg‘𝐺)‘𝑖))))
38		grimidvtxsdg.h	. . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑉)
39		fvex 6844	. . . . 5 ⊢ (Vtx‘𝐺) ∈ V
40		resfunexg 7158	. . . . 5 ⊢ ((Fun I ∧ (Vtx‘𝐺) ∈ V) → ( I ↾ (Vtx‘𝐺)) ∈ V)
41	5, 39, 40	mp2an 692	. . . 4 ⊢ ( I ↾ (Vtx‘𝐺)) ∈ V
42	41	a1i 11	. . 3 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)) ∈ V)
43		eqid 2733	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
44		eqid 2733	. . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
45	23, 43, 24, 44	isgrim 47996	. . 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 1373	. 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 713	1 ⊢ (𝜑 → ( I ↾ (Vtx‘𝐺)) ∈ (𝐺 GraphIso 𝐻))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113  ∀wral 3049  Vcvv 3438   ⊆ wss 3899   I cid 5515  dom cdm 5621   ↾ cres 5623   “ cima 5624  Fun wfun 6483  –1-1-onto→wf1o 6488  ‘cfv 6489  (class class class)co 7355  Vtxcvtx 28985  iEdgciedg 28986  UHGraphcuhgr 29045   GraphIso cgrim 47989

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-map 8761  df-uhgr 29047  df-grim 47992

This theorem is referenced by:  grimid  48000  opstrgric  48040