Theorem grimdmrel 48237

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 48235	. 2 ⊢ GraphIso = (𝑔 ∈ V, ℎ ∈ V ↦ {𝑓 ∣ (𝑓:(Vtx‘𝑔)–1-1-onto→(Vtx‘ℎ) ∧ ∃𝑗[(iEdg‘𝑔) / 𝑒][(iEdg‘ℎ) / 𝑑](𝑗:dom 𝑒–1-1-onto→dom 𝑑 ∧ ∀𝑖 ∈ dom 𝑒(𝑑‘(𝑗‘𝑖)) = (𝑓 “ (𝑒‘𝑖))))})
2	1	reldmmpo 7502	1 ⊢ Rel dom GraphIso

Syntax hints:   ∧ wa 395   = wceq 1542  ∃wex 1781  {cab 2715  ∀wral 3052  Vcvv 3442  [wsbc 3742  dom cdm 5632   “ cima 5635  Rel wrel 5637  –1-1-onto→wf1o 6499  ‘cfv 6500  Vtxcvtx 29081  iEdgciedg 29082   GraphIso cgrim 48232

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-dm 5642  df-oprab 7372  df-mpo 7373  df-grim 48235

This theorem is referenced by:  grimprop  48240  grimuhgr  48244  grimcnv  48245  grimco  48246  gricrcl  48271  uhgrimisgrgric  48288