| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > clnbgrisubgrgrim | Structured version Visualization version GIF version | ||
| Description: Isomorphic subgraphs induced by closed neighborhoods of vertices of two graphs. (Contributed by AV, 29-May-2025.) |
| Ref | Expression |
|---|---|
| clnbgrisubgrgrim.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| clnbgrisubgrgrim.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| clnbgrisubgrgrim.n | ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋) |
| clnbgrisubgrgrim.m | ⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑌) |
| clnbgrisubgrgrim.k | ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁} |
| clnbgrisubgrgrim.l | ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀} |
| Ref | Expression |
|---|---|
| clnbgrisubgrgrim | ⊢ ((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clnbgrisubgrgrim.n | . . 3 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋) | |
| 2 | eqid 2769 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 3 | 2 | clnbgrssvtx 48520 | . . 3 ⊢ (𝐺 ClNeighbVtx 𝑋) ⊆ (Vtx‘𝐺) |
| 4 | 1, 3 | eqsstri 3989 | . 2 ⊢ 𝑁 ⊆ (Vtx‘𝐺) |
| 5 | clnbgrisubgrgrim.m | . . 3 ⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑌) | |
| 6 | eqid 2769 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 7 | 6 | clnbgrssvtx 48520 | . . 3 ⊢ (𝐻 ClNeighbVtx 𝑌) ⊆ (Vtx‘𝐻) |
| 8 | 5, 7 | eqsstri 3989 | . 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 48618 | . 2 ⊢ (((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) ∧ (𝑁 ⊆ (Vtx‘𝐺) ∧ 𝑀 ⊆ (Vtx‘𝐻))) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 14 | 4, 8, 13 | mpanr12 717 | 1 ⊢ ((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ∀wral 3085 {crab 3422 ⊆ wss 3911 class class class wbr 5111 dom cdm 5662 “ cima 5665 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7411 Vtxcvtx 29287 iEdgciedg 29288 ClNeighbVtx cclnbgr 48507 ISubGr cisubgr 48549 ≃𝑔𝑟 cgric 48565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-1o 8453 df-map 8826 df-vtx 29289 df-iedg 29290 df-clnbgr 48508 df-isubgr 48550 df-grim 48567 df-gric 48570 |
| This theorem is referenced by: isgrlim2 48672 |
| Copyright terms: Public domain | W3C validator |