Theorem grimf1o 48709

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 2765	. . 3 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
4		eqid 2765	. . 3 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
5	1, 2, 3, 4	grimprop 48708	. 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 2146  ∀wral 3081  dom cdm 5663   “ cima 5666  –1-1-onto→wf1o 6539  ‘cfv 6540  (class class class)co 7419  Vtxcvtx 29403  iEdgciedg 29404   GraphIso cgrim 48700

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-grim 48703

This theorem is used by:  uhgrimedg  48716  uhgrimprop  48717  upgrimwlklem4  48725  upgrimwlklem5  48726  upgrimtrlslem2  48730  upgrimpthslem1  48732  upgrimpthslem2  48733  upgrimspths  48735  gricen  48750  clnbgrgrimlem  48758  clnbgrgrim  48759  grimgrtri  48774  uhgrimgrlim  48812