Theorem grimdmrel 47860

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 47858	. 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 395   = wceq 1540  ∃wex 1779  {cab 2714  ∀wral 3052  Vcvv 3464  [wsbc 3770  dom cdm 5659   “ cima 5662  Rel wrel 5664  –1-1-onto→wf1o 6535  ‘cfv 6536  Vtxcvtx 28980  iEdgciedg 28981   GraphIso cgrim 47855

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-br 5125  df-opab 5187  df-xp 5665  df-rel 5666  df-dm 5669  df-oprab 7414  df-mpo 7415  df-grim 47858

This theorem is referenced by:  grimprop  47863  grimuhgr  47867  grimcnv  47868  grimco  47869  gricrcl  47894  uhgrimisgrgric  47911