Theorem isgrim 48806

Description: An isomorphism of graphs is a bijection between their vertices that preserves adjacency. (Contributed by AV, 19-Apr-2025.)

Hypotheses

Ref	Expression
isgrim.v	⊢ 𝑉 = (Vtx‘𝐺)
isgrim.w	⊢ 𝑊 = (Vtx‘𝐻)
isgrim.e	⊢ 𝐸 = (iEdg‘𝐺)
isgrim.d	⊢ 𝐷 = (iEdg‘𝐻)

Assertion

Ref	Expression
isgrim	⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))))

Distinct variable groups:   𝑖,𝐹,𝑗   𝑖,𝐺,𝑗   𝑖,𝐻,𝑗

Allowed substitution hints:   𝐷(𝑖, 𝑗)   𝐸(𝑖, 𝑗)   𝑉(𝑖, 𝑗)   𝑊(𝑖, 𝑗)   𝑋(𝑖, 𝑗)   𝑌(𝑖, 𝑗)   𝑍(𝑖, 𝑗)

Proof of Theorem isgrim

Dummy variables 𝑑 𝑓 𝑒 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-grim 48802	. . 3 ⊢ GraphIso = (𝑔 ∈ V, ℎ ∈ V ↦ {𝑓 ∣ (𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ∧ ∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))))})
2		elex 3474	. . . 4 ⊢ (𝐺 ∈ 𝑋 → 𝐺 ∈ V)
3	2	3ad2ant1 1151	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → 𝐺 ∈ V)
4		elex 3474	. . . 4 ⊢ (𝐻 ∈ 𝑌 → 𝐻 ∈ V)
5	4	3ad2ant2 1152	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → 𝐻 ∈ V)
6		f1of 6821	. . . . . . 7 ⊢ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) → 𝑓:(Vtx‘𝐺)⟶(Vtx‘𝐻))
7		fvex 6895	. . . . . . . 8 ⊢ (Vtx‘𝐻) ∈ V
8		fvex 6895	. . . . . . . 8 ⊢ (Vtx‘𝐺) ∈ V
9	7, 8	elmap 8882	. . . . . . 7 ⊢ (𝑓 ∈ ((Vtx‘𝐻) ↑m (Vtx‘𝐺)) ↔ 𝑓:(Vtx‘𝐺)⟶(Vtx‘𝐻))
10	6, 9	sylibr 237	. . . . . 6 ⊢ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) → 𝑓 ∈ ((Vtx‘𝐻) ↑m (Vtx‘𝐺)))
11	10	adantr 486	. . . . 5 ⊢ ((𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))) → 𝑓 ∈ ((Vtx‘𝐻) ↑m (Vtx‘𝐺)))
12		ovex 7450	. . . . 5 ⊢ ((Vtx‘𝐻) ↑m (Vtx‘𝐺)) ∈ V
13	11, 12	abex 5295	. . . 4 ⊢ {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))} ∈ V
14	13	a1i 11	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))} ∈ V)
15		eqidd 2763	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → 𝑓 = 𝑓)
16		fveq2 6882	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
17	16	adantr 486	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (Vtx‘𝑔) = (Vtx‘𝐺))
18		fveq2 6882	. . . . . . 7 ⊢ (ℎ = 𝐻 → (Vtx‘ℎ) = (Vtx‘𝐻))
19	18	adantl 487	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (Vtx‘ℎ) = (Vtx‘𝐻))
20	15, 17, 19	f1oeq123d 6815	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ↔ 𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻)))
21		fvexd 6897	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (iEdg‘𝑔) ∈ V)
22		fveq2 6882	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
23	22	adantr 486	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (iEdg‘𝑔) = (iEdg‘𝐺))
24		fvexd 6897	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ ℎ = 𝐻) ∧ 𝑒 = (iEdg‘𝐺)) → (iEdg‘ℎ) ∈ V)
25		fveq2 6882	. . . . . . . . . . 11 ⊢ (ℎ = 𝐻 → (iEdg‘ℎ) = (iEdg‘𝐻))
26	25	adantl 487	. . . . . . . . . 10 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (iEdg‘ℎ) = (iEdg‘𝐻))
27	26	adantr 486	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ ℎ = 𝐻) ∧ 𝑒 = (iEdg‘𝐺)) → (iEdg‘ℎ) = (iEdg‘𝐻))
28		eqidd 2763	. . . . . . . . . . . 12 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → 𝑗 = 𝑗)
29		dmeq 5891	. . . . . . . . . . . . 13 ⊢ (𝑒 = (iEdg‘𝐺) → dom 𝑒 = dom (iEdg‘𝐺))
30	29	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → dom 𝑒 = dom (iEdg‘𝐺))
31		dmeq 5891	. . . . . . . . . . . . 13 ⊢ (𝑑 = (iEdg‘𝐻) → dom 𝑑 = dom (iEdg‘𝐻))
32	31	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → dom 𝑑 = dom (iEdg‘𝐻))
33	28, 30, 32	f1oeq123d 6815	. . . . . . . . . . 11 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → (𝑗:dom 𝑒–1-1-onto→dom 𝑑 ↔ 𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻)))
34		fveq1 6881	. . . . . . . . . . . . 13 ⊢ (𝑑 = (iEdg‘𝐻) → (𝑑‘(𝑗‘𝑖)) = ((iEdg‘𝐻)‘(𝑗‘𝑖)))
35		fveq1 6881	. . . . . . . . . . . . . 14 ⊢ (𝑒 = (iEdg‘𝐺) → (𝑒‘𝑖) = ((iEdg‘𝐺)‘𝑖))
36	35	imaeq2d 6060	. . . . . . . . . . . . 13 ⊢ (𝑒 = (iEdg‘𝐺) → (𝑓 “ (𝑒‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))
37	34, 36	eqeqan12rd 2777	. . . . . . . . . . . 12 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → ((𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖)) ↔ ((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))
38	30, 37	raleqbidv 3336	. . . . . . . . . . 11 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → (∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖)) ↔ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))
39	33, 38	anbi12d 644	. . . . . . . . . 10 ⊢ ((𝑒 = (iEdg‘𝐺) ∧ 𝑑 = (iEdg‘𝐻)) → ((𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
40	39	adantll 727	. . . . . . . . 9 ⊢ ((((𝑔 = 𝐺 ∧ ℎ = 𝐻) ∧ 𝑒 = (iEdg‘𝐺)) ∧ 𝑑 = (iEdg‘𝐻)) → ((𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
41	24, 27, 40	sbcied2 3786	. . . . . . . 8 ⊢ (((𝑔 = 𝐺 ∧ ℎ = 𝐻) ∧ 𝑒 = (iEdg‘𝐺)) → ([(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
42	21, 23, 41	sbcied2 3786	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ([(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
43		biidd 265	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ((𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
44	42, 43	bitrd 282	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ([(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
45	44	exbidv 1954	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))) ↔ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))))
46	20, 45	anbi12d 644	. . . 4 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ((𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ∧ ∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖)))) ↔ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))))
47	46	abbidv 2828	. . 3 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → {𝑓 ∣ (𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ∧ ∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))))} = {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))})
48	1, 3, 5, 14, 47	elovmpod 7662	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))}))
49		id 23	. . . . . 6 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹)
50		isgrim.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
51	50	eqcomi 2771	. . . . . . 7 ⊢ (Vtx‘𝐺) = 𝑉
52	51	a1i 11	. . . . . 6 ⊢ (𝑓 = 𝐹 → (Vtx‘𝐺) = 𝑉)
53		isgrim.w	. . . . . . . 8 ⊢ 𝑊 = (Vtx‘𝐻)
54	53	eqcomi 2771	. . . . . . 7 ⊢ (Vtx‘𝐻) = 𝑊
55	54	a1i 11	. . . . . 6 ⊢ (𝑓 = 𝐹 → (Vtx‘𝐻) = 𝑊)
56	49, 52, 55	f1oeq123d 6815	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ↔ 𝐹:𝑉–1-1-onto→𝑊))
57		eqidd 2763	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → 𝑗 = 𝑗)
58		isgrim.e	. . . . . . . . . . 11 ⊢ 𝐸 = (iEdg‘𝐺)
59	58	eqcomi 2771	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = 𝐸
60	59	dmeqi 5892	. . . . . . . . 9 ⊢ dom (iEdg‘𝐺) = dom 𝐸
61	60	a1i 11	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → dom (iEdg‘𝐺) = dom 𝐸)
62		isgrim.d	. . . . . . . . . . 11 ⊢ 𝐷 = (iEdg‘𝐻)
63	62	eqcomi 2771	. . . . . . . . . 10 ⊢ (iEdg‘𝐻) = 𝐷
64	63	dmeqi 5892	. . . . . . . . 9 ⊢ dom (iEdg‘𝐻) = dom 𝐷
65	64	a1i 11	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → dom (iEdg‘𝐻) = dom 𝐷)
66	57, 61, 65	f1oeq123d 6815	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ↔ 𝑗:dom 𝐸–1-1-onto→dom 𝐷))
67	63	fveq1i 6883	. . . . . . . . . 10 ⊢ ((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝐷‘(𝑗‘𝑖))
68	67	a1i 11	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝐷‘(𝑗‘𝑖)))
69	59	fveq1i 6883	. . . . . . . . . . 11 ⊢ ((iEdg‘𝐺)‘𝑖) = (𝐸‘𝑖)
70	69	a1i 11	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → ((iEdg‘𝐺)‘𝑖) = (𝐸‘𝑖))
71	49, 70	imaeq12d 6061	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝐹 “ (𝐸‘𝑖)))
72	68, 71	eqeq12d 2778	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)) ↔ (𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))
73	61, 72	raleqbidv 3336	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)) ↔ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))
74	66, 73	anbi12d 644	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))) ↔ (𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖)))))
75	74	exbidv 1954	. . . . 5 ⊢ (𝑓 = 𝐹 → (∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))) ↔ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖)))))
76	56, 75	anbi12d 644	. . . 4 ⊢ (𝑓 = 𝐹 → ((𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))))
77	76	elabg 3633	. . 3 ⊢ (𝐹 ∈ 𝑍 → (𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))} ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))))
78	77	3ad2ant3 1153	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝑓 “ ((iEdg‘𝐺)‘𝑖))))} ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))))
79	48, 78	bitrd 282	1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom 𝐸–1-1-onto→dom 𝐷 ∧ ∀𝑖 ∈ dom 𝐸(𝐷‘(𝑗‘𝑖)) = (𝐹 “ (𝐸‘𝑖))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2740  ∀wral 3078  Vcvv 3453  [wsbc 3742  dom cdm 5659   “ cima 5662  ⟶wf 6533  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7417   ↑_m cmap 8830  Vtxcvtx 29461  iEdgciedg 29462   GraphIso cgrim 48799

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-pow 5334  ax-pr 5402  ax-un 7740

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-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-map 8832  df-grim 48802

This theorem is used by:  grimprop  48807  grimidvtxedg  48809  grimcnv  48812  grimco  48813  isuspgrim0  48818  dfgric2  48839