Theorem dfgrlic3 48256

Description: Alternate, explicit definition of the "is locally isomorphic to" relation for two graphs. (Contributed by AV, 9-Jun-2025.)

Hypotheses

Ref	Expression
dfgrlic2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfgrlic2.w	⊢ 𝑊 = (Vtx‘𝐻)
dfgrlic3.i	⊢ 𝐼 = (iEdg‘𝐺)
dfgrlic3.j	⊢ 𝐽 = (iEdg‘𝐻)
dfgrlic3.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
dfgrlic3.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑣))
dfgrlic3.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
dfgrlic3.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
dfgrlic3	⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

Distinct variable groups:   𝑓,𝐺,𝑣   𝑓,𝐻,𝑣   𝑣,𝑉   𝑓,𝑋   𝑓,𝑌   𝑔,𝐺,𝑖,𝑗,𝑓,𝑣   𝑥,𝐺   𝑔,𝐻,𝑖,𝑗   𝑥,𝐻   𝑖,𝐼,𝑥   𝑖,𝐽,𝑥   𝑖,𝐾   𝑔,𝑋,𝑗,𝑣   𝑖,𝐿   𝑔,𝑀,𝑖,𝑗   𝑥,𝑀   𝑔,𝑁,𝑖,𝑗   𝑥,𝑁   𝑖,𝑋   𝑖,𝑌,𝑗,𝑔,𝑣

Allowed substitution hints:   𝐼(𝑣,𝑓,𝑔,𝑗)   𝐽(𝑣,𝑓,𝑔,𝑗)   𝐾(𝑥,𝑣,𝑓,𝑔,𝑗)   𝐿(𝑥,𝑣,𝑓,𝑔,𝑗)   𝑀(𝑣,𝑓)   𝑁(𝑣,𝑓)   𝑉(𝑥,𝑓,𝑔,𝑖,𝑗)   𝑊(𝑥,𝑣,𝑓,𝑔,𝑖,𝑗)   𝑋(𝑥)   𝑌(𝑥)

Proof of Theorem dfgrlic3

Step	Hyp	Ref	Expression
1		brgrlic 48250	. . 3 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ (𝐺 GraphLocIso 𝐻) ≠ ∅)
2		n0 4305	. . 3 ⊢ ((𝐺 GraphLocIso 𝐻) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐺 GraphLocIso 𝐻))
3	1, 2	bitri 275	. 2 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ ∃𝑓 𝑓 ∈ (𝐺 GraphLocIso 𝐻))
4		dfgrlic2.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
5		dfgrlic2.w	. . . . 5 ⊢ 𝑊 = (Vtx‘𝐻)
6		dfgrlic3.n	. . . . 5 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
7		dfgrlic3.m	. . . . 5 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑣))
8		dfgrlic3.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
9		dfgrlic3.j	. . . . 5 ⊢ 𝐽 = (iEdg‘𝐻)
10		dfgrlic3.k	. . . . 5 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
11		dfgrlic3.l	. . . . 5 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
12	4, 5, 6, 7, 8, 9, 10, 11	isgrlim2 48229	. . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝑓 ∈ V) → (𝑓 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
13	12	el3v3 3449	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → (𝑓 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
14	13	exbidv 1922	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → (∃𝑓 𝑓 ∈ (𝐺 GraphLocIso 𝐻) ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
15	3, 14	bitrid 283	1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051  {crab 3399  Vcvv 3440   ⊆ wss 3901  ∅c0 4285   class class class wbr 5098  dom cdm 5624   “ cima 5627  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7358  Vtxcvtx 29069  iEdgciedg 29070   ClNeighbVtx cclnbgr 48064   GraphLocIso cgrlim 48222   ≃_𝑙𝑔𝑟 cgrlic 48223

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-1o 8397  df-map 8765  df-vtx 29071  df-iedg 29072  df-clnbgr 48065  df-isubgr 48107  df-grim 48124  df-gric 48127  df-grlim 48224  df-grlic 48227

This theorem is referenced by:  grilcbri2  48257