| 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 47981 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))) |
| 4 | isgrlim2.n | . . . . . . . . 9 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣) | |
| 5 | 4 | eqcomi 2738 | . . . . . . . 8 ⊢ (𝐺 ClNeighbVtx 𝑣) = 𝑁 |
| 6 | 5 | oveq2i 7398 | . . . . . . 7 ⊢ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) = (𝐺 ISubGr 𝑁) |
| 7 | isgrlim2.m | . . . . . . . . 9 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣)) | |
| 8 | 7 | eqcomi 2738 | . . . . . . . 8 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑣)) = 𝑀 |
| 9 | 8 | oveq2i 7398 | . . . . . . 7 ⊢ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) = (𝐻 ISubGr 𝑀) |
| 10 | 6, 9 | breq12i 5116 | . . . . . 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 47932 | . . . . . 6 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 17 | 16 | 3adant3 1132 | . . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 18 | 11, 17 | bitrd 279 | . . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 19 | 18 | ralbidv 3156 | . . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 20 | 19 | anbi2d 630 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| 21 | 3, 20 | bitrd 279 | 1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∀wral 3044 {crab 3405 ⊆ wss 3914 class class class wbr 5107 dom cdm 5638 “ cima 5641 –1-1-onto→wf1o 6510 ‘cfv 6511 (class class class)co 7387 Vtxcvtx 28923 iEdgciedg 28924 ClNeighbVtx cclnbgr 47819 ISubGr cisubgr 47860 ≃𝑔𝑟 cgric 47876 GraphLocIso cgrlim 47975 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-1st 7968 df-2nd 7969 df-1o 8434 df-map 8801 df-vtx 28925 df-iedg 28926 df-clnbgr 47820 df-isubgr 47861 df-grim 47878 df-gric 47881 df-grlim 47977 |
| This theorem is referenced by: grlimprop2 47985 uspgrlim 47991 dfgrlic3 48002 |
| Copyright terms: Public domain | W3C validator |