Theorem grimf1o 48981

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 2761	. . 3 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
4		eqid 2761	. . 3 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
5	1, 2, 3, 4	grimprop 48980	. 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 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  dom cdm 5651   “ cima 5654  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420  Vtxcvtx 29574  iEdgciedg 29575   GraphIso cgrim 48972

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-grim 48975

This theorem is used by:  uhgrimedg  48988  uhgrimprop  48989  upgrimwlklem4  48997  upgrimwlklem5  48998  upgrimtrlslem2  49002  upgrimpthslem1  49004  upgrimpthslem2  49005  upgrimspths  49007  gricen  49022  clnbgrgrimlem  49030  clnbgrgrim  49031  grimgrtri  49046  uhgrimgrlim  49084