Theorem isuspgrim 47841

Description: A class is an isomorphism of simple pseudographs iff it is a bijection between their vertices that preserves adjacency, i.e. there is an edge in one graph connecting one or two vertices iff there is an edge in the other graph connecting the vertices which are the images of the vertices. This corresponds to the formal definition in [Bollobas] p. 3 and the definition in [Diestel] p. 3. (Contributed by AV, 27-Apr-2025.)

Hypotheses

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

Assertion

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

Distinct variable groups:   𝑥,𝐸   𝑥,𝐹   𝑥,𝐷,𝑦   𝑦,𝐸   𝑦,𝐹   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑥,𝑉,𝑦   𝑥,𝑊,𝑦

Proof of Theorem isuspgrim

Dummy variable 𝑒 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isusgrim.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		isusgrim.w	. . 3 ⊢ 𝑊 = (Vtx‘𝐻)
3		isusgrim.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
4		isusgrim.d	. . 3 ⊢ 𝐷 = (Edg‘𝐻)
5	1, 2, 3, 4	uspgrimprop 47839	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (𝐹 ∈ (𝐺 GraphIso 𝐻) → (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷))))
6		f1of 6856	. . . . . 6 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉⟶𝑊)
7	1	fvexi 6928	. . . . . . 7 ⊢ 𝑉 ∈ V
8	7	a1i 11	. . . . . 6 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝑉 ∈ V)
9	6, 8	fexd 7254	. . . . 5 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹 ∈ V)
10	9	adantl 481	. . . 4 ⊢ (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) → 𝐹 ∈ V)
11		simpllr 776	. . . . . 6 ⊢ (((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝐹 ∈ V) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → 𝐹:𝑉–1-1-onto→𝑊)
12	1, 2, 3, 4	isuspgrimlem 47840	. . . . . . 7 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → (𝑒 ∈ 𝐸 ↦ (𝐹 “ 𝑒)):𝐸–1-1-onto→𝐷)
13	12	adantlr 715	. . . . . 6 ⊢ (((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝐹 ∈ V) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → (𝑒 ∈ 𝐸 ↦ (𝐹 “ 𝑒)):𝐸–1-1-onto→𝐷)
14	1, 2, 3, 4	isuspgrim0 47838	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph ∧ 𝐹 ∈ V) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ (𝑒 ∈ 𝐸 ↦ (𝐹 “ 𝑒)):𝐸–1-1-onto→𝐷)))
15	14	ad5ant124 1366	. . . . . 6 ⊢ (((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝐹 ∈ V) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ (𝑒 ∈ 𝐸 ↦ (𝐹 “ 𝑒)):𝐸–1-1-onto→𝐷)))
16	11, 13, 15	mpbir2and 713	. . . . 5 ⊢ (((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝐹 ∈ V) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → 𝐹 ∈ (𝐺 GraphIso 𝐻))
17	16	ex 412	. . . 4 ⊢ ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝐹 ∈ V) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷) → 𝐹 ∈ (𝐺 GraphIso 𝐻)))
18	10, 17	mpdan 687	. . 3 ⊢ (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ 𝐹:𝑉–1-1-onto→𝑊) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷) → 𝐹 ∈ (𝐺 GraphIso 𝐻)))
19	18	expimpd 453	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷)) → 𝐹 ∈ (𝐺 GraphIso 𝐻)))
20	5, 19	impbid 212	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (𝐹 ∈ (𝐺 GraphIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ({𝑥, 𝑦} ∈ 𝐸 ↔ {(𝐹‘𝑥), (𝐹‘𝑦)} ∈ 𝐷))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3061  Vcvv 3481  {cpr 4636   ↦ cmpt 5234   “ cima 5696  –1-1-onto→wf1o 6568  ‘cfv 6569  (class class class)co 7438  Vtxcvtx 29039  Edgcedg 29090  USPGraphcuspgr 29191   GraphIso cgrim 47827

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5288  ax-sep 5305  ax-nul 5315  ax-pow 5374  ax-pr 5441  ax-un 7761  ax-cnex 11218  ax-resscn 11219  ax-1cn 11220  ax-icn 11221  ax-addcl 11222  ax-addrcl 11223  ax-mulcl 11224  ax-mulrcl 11225  ax-mulcom 11226  ax-addass 11227  ax-mulass 11228  ax-distr 11229  ax-i2m1 11230  ax-1ne0 11231  ax-1rid 11232  ax-rnegex 11233  ax-rrecex 11234  ax-cnre 11235  ax-pre-lttri 11236  ax-pre-lttrn 11237  ax-pre-ltadd 11238  ax-pre-mulgt0 11239

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3483  df-sbc 3795  df-csb 3912  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-pss 3986  df-nul 4343  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-int 4955  df-iun 5001  df-br 5152  df-opab 5214  df-mpt 5235  df-tr 5269  df-id 5587  df-eprel 5593  df-po 5601  df-so 5602  df-fr 5645  df-we 5647  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-pred 6329  df-ord 6395  df-on 6396  df-lim 6397  df-suc 6398  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-f1 6574  df-fo 6575  df-f1o 6576  df-fv 6577  df-riota 7395  df-ov 7441  df-oprab 7442  df-mpo 7443  df-om 7895  df-1st 8022  df-2nd 8023  df-frecs 8314  df-wrecs 8345  df-recs 8419  df-rdg 8458  df-1o 8514  df-2o 8515  df-oadd 8518  df-er 8753  df-map 8876  df-en 8994  df-dom 8995  df-sdom 8996  df-fin 8997  df-dju 9948  df-card 9986  df-pnf 11304  df-mnf 11305  df-xr 11306  df-ltxr 11307  df-le 11308  df-sub 11501  df-neg 11502  df-nn 12274  df-2 12336  df-n0 12534  df-xnn0 12607  df-z 12621  df-uz 12886  df-fz 13554  df-hash 14376  df-edg 29091  df-uhgr 29101  df-upgr 29125  df-uspgr 29193  df-grim 47830

This theorem is referenced by:  gricuspgr  47853