| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isgrlim2 | Structured version Visualization version GIF version | ||
| Description: A local isomorphism of graphs is a bijection between their vertices that preserves neighborhoods. Definitions expanded. (Contributed by AV, 29-May-2025.) |
| Ref | Expression |
|---|---|
| isgrlim.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| isgrlim.w | ⊢ 𝑊 = (Vtx‘𝐻) |
| isgrlim2.n | ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣) |
| isgrlim2.m | ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣)) |
| isgrlim2.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| isgrlim2.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| isgrlim2.k | ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁} |
| isgrlim2.l | ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀} |
| Ref | Expression |
|---|---|
| isgrlim2 | ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isgrlim.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | isgrlim.w | . . 3 ⊢ 𝑊 = (Vtx‘𝐻) | |
| 3 | 1, 2 | isgrlim 48730 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))) |
| 4 | isgrlim2.n | . . . . . . . . 9 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣) | |
| 5 | 4 | eqcomi 2772 | . . . . . . . 8 ⊢ (𝐺 ClNeighbVtx 𝑣) = 𝑁 |
| 6 | 5 | oveq2i 7423 | . . . . . . 7 ⊢ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) = (𝐺 ISubGr 𝑁) |
| 7 | isgrlim2.m | . . . . . . . . 9 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣)) | |
| 8 | 7 | eqcomi 2772 | . . . . . . . 8 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑣)) = 𝑀 |
| 9 | 8 | oveq2i 7423 | . . . . . . 7 ⊢ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) = (𝐻 ISubGr 𝑀) |
| 10 | 6, 9 | breq12i 5119 | . . . . . 6 ⊢ ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀)) |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀))) |
| 12 | isgrlim2.i | . . . . . . 7 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 13 | isgrlim2.j | . . . . . . 7 ⊢ 𝐽 = (iEdg‘𝐻) | |
| 14 | isgrlim2.k | . . . . . . 7 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁} | |
| 15 | isgrlim2.l | . . . . . . 7 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀} | |
| 16 | 12, 13, 4, 7, 14, 15 | clnbgrisubgrgrim 48680 | . . . . . 6 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 17 | 16 | 3adant3 1150 | . . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 18 | 11, 17 | bitrd 282 | . . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 19 | 18 | ralbidv 3188 | . . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 20 | 19 | anbi2d 641 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| 21 | 3, 20 | bitrd 282 | 1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ∀wral 3079 {crab 3416 ⊆ wss 3906 class class class wbr 5110 dom cdm 5663 “ cima 5666 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7412 Vtxcvtx 29327 iEdgciedg 29328 ClNeighbVtx cclnbgr 48566 ISubGr cisubgr 48608 ≃𝑔𝑟 cgric 48624 GraphLocIso cgrlim 48724 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-1o 8454 df-map 8827 df-vtx 29329 df-iedg 29330 df-clnbgr 48567 df-isubgr 48609 df-grim 48626 df-gric 48629 df-grlim 48726 |
| This theorem is referenced by: grlimprop2 48734 uspgrlim 48740 dfgrlic3 48758 |
| Copyright terms: Public domain | W3C validator |