Theorem uhgrimprop 49193

Description: An isomorphism between hypergraphs is a bijection between their vertices that preserves adjacency for simple edges, i.e. there is a simple edge in one graph connecting one or two vertices iff there is a simple edge in the other graph connecting the vertices which are the images of the vertices. (Contributed by AV, 27-Apr-2025.) (Revised by AV, 25-Oct-2025.)

Hypotheses

Ref	Expression
uhgrimedgi.e	⊢ 𝐸 = (Edg‘𝐺)
uhgrimedgi.d	⊢ 𝐷 = (Edg‘𝐻)
uhgrimprop.v	⊢ 𝑉 = (Vtx‘𝐺)
uhgrimprop.w	⊢ 𝑊 = (Vtx‘𝐻)

Assertion

Ref	Expression
uhgrimprop	⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑦,𝑉

Allowed substitution hints:   𝐷(𝑥, 𝑦)   𝐸(𝑥, 𝑦)   𝑉(𝑥)   𝑊(𝑥, 𝑦)

Proof of Theorem uhgrimprop

Step	Hyp	Ref	Expression
1		uhgrimprop.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		uhgrimprop.w	. . . 4 ⊢ 𝑊 = (Vtx‘𝐻)
3	1, 2	grimf1o 49185	. . 3 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:𝑉⟶1-1onto𝑊)
4	3	3ad2ant3 1153	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹:𝑉⟶1-1onto𝑊)
5		3simpa 1166	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph))
6		simp3 1156	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 ∈ (𝐺 GraphIso 𝐻))
7		prssi 4780	. . . . . 6 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → {𝑥, 𝑦} ⊆ 𝑉)
8	7, 1	sseqtrdi 3953	. . . . 5 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → {𝑥, 𝑦} ⊆ (Vtx‘𝐺))
9		uhgrimedgi.e	. . . . . 6 ⊢ 𝐸 = (Edg‘𝐺)
10		uhgrimedgi.d	. . . . . 6 ⊢ 𝐷 = (Edg‘𝐻)
11	9, 10	uhgrimedg 49192	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻) ∧ {𝑥, 𝑦} ⊆ (Vtx‘𝐺)) → ({𝑥, 𝑦} ∈ 𝐸 ↔ (𝐹 “ {𝑥, 𝑦}) ∈ 𝐷))
12	5, 6, 8, 11	syl2an3an 1450	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ({𝑥, 𝑦} ∈ 𝐸 ↔ (𝐹 “ {𝑥, 𝑦}) ∈ 𝐷))
13		f1ofn 6844	. . . . . . . . . 10 ⊢ (𝐹:𝑉⟶1-1onto𝑊 → 𝐹 Fn 𝑉)
14	3, 13	syl 18	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹 Fn 𝑉)
15	14	3ad2ant3 1153	. . . . . . . 8 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 Fn 𝑉)
16	15	anim1i 627	. . . . . . 7 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝐹 Fn 𝑉 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
17		3anass 1111	. . . . . . 7 ⊢ ((𝐹 Fn 𝑉 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ↔ (𝐹 Fn 𝑉 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)))
18	16, 17	sylibr 237	. . . . . 6 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝐹 Fn 𝑉 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉))
19		fnimapr 6988	. . . . . 6 ⊢ ((𝐹 Fn 𝑉 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝐹 “ {𝑥, 𝑦}) = {(𝐹‘𝑥), (𝐹‘𝑦)})
20	18, 19	syl 18	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝐹 “ {𝑥, 𝑦}) = {(𝐹‘𝑥), (𝐹‘𝑦)})
21	20	eleq1d 2849	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ((𝐹 “ {𝑥, 𝑦}) ∈ 𝐷 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷))
22	12, 21	bitrd 282	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷))
23	22	ralrimivva 3209	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷))
24	4, 23	jca 521	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  {cpr 4590   “ cima 5658   Fn wfn 6550  ⟶1-1ontowf1o 6554  ‘cfv 6555  (class class class)co 7440  Vtxcvtx 29601  Edgcedg 29652  UHGraphcuhgr 29661   GraphIso cgrim 49176

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-edg 29653  df-uhgr 29663  df-grim 49179

This theorem is used by:  isuspgrim  49197