Theorem grimdmrel 48628

Description: The domain of the graph isomorphism function is a relation. (Contributed by AV, 28-Apr-2025.)

Assertion

Ref	Expression
grimdmrel	⊢ Rel dom GraphIso

Proof of Theorem grimdmrel

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

Step	Hyp	Ref	Expression
1		df-grim 48626	. 2 ⊢ GraphIso = (𝑔 ∈ V, ℎ ∈ V ↦ {𝑓 ∣ (𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ∧ ∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))))})
2	1	reldmmpo 7546	1 ⊢ Rel dom GraphIso

Syntax hints:   ∧ wa 400   = wceq 1570  ∃wex 1809  {cab 2741  ∀wral 3079  Vcvv 3455  [wsbc 3745  dom cdm 5663   “ cima 5666  Rel wrel 5668  –1-1-onto→wf1o 6537  ‘cfv 6538  Vtxcvtx 29327  iEdgciedg 29328   GraphIso cgrim 48623

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-xp 5669  df-rel 5670  df-dm 5673  df-oprab 7416  df-mpo 7417  df-grim 48626

This theorem is referenced by:  grimprop  48631  grimuhgr  48635  grimcnv  48636  grimco  48637  gricrcl  48662  uhgrimisgrgric  48679