Theorem grimf1o 49121

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

Hypotheses

Ref	Expression
grimprop.v	⊢ 𝑉 = (Vtx‘𝐺)
grimprop.w	⊢ 𝑊 = (Vtx‘𝐻)

Assertion

Ref	Expression
grimf1o	⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:𝑉–1-1-onto→𝑊)

Proof of Theorem grimf1o

Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grimprop.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		grimprop.w	. . 3 ⊢ 𝑊 = (Vtx‘𝐻)
3		eqid 2763	. . 3 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
4		eqid 2763	. . 3 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
5	1, 2, 3, 4	grimprop 49120	. 2 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → (𝐹:𝑉–1-1-onto→𝑊 ∧ ∃𝑗(𝑗:dom (iEdg‘𝐺)–1-1-onto→dom (iEdg‘𝐻) ∧ ∀𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐻)‘(𝑗‘𝑖)) = (𝐹 “ ((iEdg‘𝐺)‘𝑖)))))
6	5	simpld 500	1 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:𝑉–1-1-onto→𝑊)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146  ∀wral 3079  dom cdm 5654   “ cima 5657  –1-1-onto→wf1o 6545  ‘cfv 6546  (class class class)co 7427  Vtxcvtx 29586  iEdgciedg 29587   GraphIso cgrim 49112

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-map 8860  df-grim 49115

This theorem is used by:  uhgrimedg  49128  uhgrimprop  49129  upgrimwlklem4  49137  upgrimwlklem5  49138  upgrimtrlslem2  49142  upgrimpthslem1  49144  upgrimpthslem2  49145  upgrimspths  49147  gricen  49162  clnbgrgrimlem  49170  clnbgrgrim  49171  grimgrtri  49186  uhgrimgrlim  49224