Theorem clnbgrisubgrgrim 49123

Description: Isomorphic subgraphs induced by closed neighborhoods of vertices of two graphs. (Contributed by AV, 29-May-2025.)

Hypotheses

Ref	Expression
clnbgrisubgrgrim.i	⊢ 𝐼 = (iEdg‘𝐺)
clnbgrisubgrgrim.j	⊢ 𝐽 = (iEdg‘𝐻)
clnbgrisubgrgrim.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
clnbgrisubgrgrim.m	⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑌)
clnbgrisubgrgrim.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
clnbgrisubgrgrim.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
clnbgrisubgrgrim	⊢ ((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

Distinct variable groups:   𝑓,𝐺,𝑔,𝑖   𝑥,𝐺   𝑓,𝐻,𝑔,𝑖   𝑥,𝐻   𝑥,𝐼   𝑥,𝐽   𝑓,𝑀,𝑔,𝑖   𝑥,𝑀   𝑓,𝑁,𝑔,𝑖   𝑥,𝑁   𝑇,𝑓,𝑔,𝑖   𝑈,𝑓,𝑔,𝑖   𝑖,𝐾   𝑖,𝐿

Allowed substitution hints:   𝑇(𝑥)   𝑈(𝑥)   𝐼(𝑓, 𝑔, 𝑖)   𝐽(𝑓, 𝑔, 𝑖)   𝐾(𝑥, 𝑓, 𝑔)   𝐿(𝑥, 𝑓, 𝑔)   𝑋(𝑥, 𝑓, 𝑔, 𝑖)   𝑌(𝑥, 𝑓, 𝑔, 𝑖)

Proof of Theorem clnbgrisubgrgrim

Step	Hyp	Ref	Expression
1		clnbgrisubgrgrim.n	. . 3 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
2		eqid 2760	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3	2	clnbgrssvtx 49022	. . 3 ⊢ (𝐺 ClNeighbVtx 𝑋) ⊆ (Vtx‘𝐺)
4	1, 3	eqsstri 3954	. 2 ⊢ 𝑁 ⊆ (Vtx‘𝐺)
5		clnbgrisubgrgrim.m	. . 3 ⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑌)
6		eqid 2760	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
7	6	clnbgrssvtx 49022	. . 3 ⊢ (𝐻 ClNeighbVtx 𝑌) ⊆ (Vtx‘𝐻)
8	5, 7	eqsstri 3954	. 2 ⊢ 𝑀 ⊆ (Vtx‘𝐻)
9		clnbgrisubgrgrim.i	. . 3 ⊢ 𝐼 = (iEdg‘𝐺)
10		clnbgrisubgrgrim.j	. . 3 ⊢ 𝐽 = (iEdg‘𝐻)
11		clnbgrisubgrgrim.k	. . 3 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
12		clnbgrisubgrgrim.l	. . 3 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
13	2, 6, 9, 10, 11, 12	isubgrgrim 49120	. 2 ⊢ (((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) ∧ (𝑁 ⊆ (Vtx‘𝐺) ∧ 𝑀 ⊆ (Vtx‘𝐻))) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
14	4, 8, 13	mpanr12 718	1 ⊢ ((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  {crab 3412   ⊆ wss 3895   class class class wbr 5102  dom cdm 5650   “ cima 5653  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420  Vtxcvtx 29579  iEdgciedg 29580   ClNeighbVtx cclnbgr 49009   ISubGr cisubgr 49051   ≃_𝑔𝑟 cgric 49067

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-suc 6368  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-1st 8001  df-2nd 8002  df-1o 8479  df-map 8852  df-vtx 29581  df-iedg 29582  df-clnbgr 49010  df-isubgr 49052  df-grim 49069  df-gric 49072

This theorem is used by:  isgrlim2  49174