| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > upgrimtrls | Structured version Visualization version GIF version | ||
| Description: Graph isomorphisms between simple pseudographs map trails onto trails. (Contributed by AV, 29-Oct-2025.) |
| Ref | Expression |
|---|---|
| upgrimwlk.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| upgrimwlk.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| upgrimwlk.g | ⊢ (𝜑 → 𝐺 ∈ USPGraph) |
| upgrimwlk.h | ⊢ (𝜑 → 𝐻 ∈ USPGraph) |
| upgrimwlk.n | ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) |
| upgrimwlk.e | ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) |
| upgrimtrls.t | ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| Ref | Expression |
|---|---|
| upgrimtrls | ⊢ (𝜑 → 𝐸(Trails‘𝐻)(𝑁 ∘ 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgrimwlk.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 2 | upgrimwlk.j | . . 3 ⊢ 𝐽 = (iEdg‘𝐻) | |
| 3 | upgrimwlk.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ USPGraph) | |
| 4 | upgrimwlk.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ USPGraph) | |
| 5 | upgrimwlk.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) | |
| 6 | upgrimwlk.e | . . 3 ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) | |
| 7 | upgrimtrls.t | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 8 | trliswlk 29786 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 9 | 7, 8 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| 10 | 1, 2, 3, 4, 5, 6, 9 | upgrimwlk 48407 | . 2 ⊢ (𝜑 → 𝐸(Walks‘𝐻)(𝑁 ∘ 𝑃)) |
| 11 | 4 | adantr 482 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → 𝐻 ∈ USPGraph) |
| 12 | 2 | uspgrf1oedg 29264 | . . . . . . . 8 ⊢ (𝐻 ∈ USPGraph → 𝐽:dom 𝐽–1-1-onto→(Edg‘𝐻)) |
| 13 | 11, 12 | syl 17 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → 𝐽:dom 𝐽–1-1-onto→(Edg‘𝐻)) |
| 14 | 1, 2, 3, 4, 5, 6, 7 | upgrimtrlslem1 48409 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ (Edg‘𝐻)) |
| 15 | f1ocnvdm 7233 | . . . . . . 7 ⊢ ((𝐽:dom 𝐽–1-1-onto→(Edg‘𝐻) ∧ (𝑁 “ (𝐼‘(𝐹‘𝑥))) ∈ (Edg‘𝐻)) → (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) ∈ dom 𝐽) | |
| 16 | 13, 14, 15 | syl2anc 591 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ dom 𝐹) → (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) ∈ dom 𝐽) |
| 17 | 16 | ralrimiva 3133 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom 𝐹(◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) ∈ dom 𝐽) |
| 18 | 1, 2, 3, 4, 5, 6, 7 | upgrimtrlslem2 48410 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ dom 𝐹 ∧ 𝑦 ∈ dom 𝐹)) → ((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → 𝑥 = 𝑦)) |
| 19 | 18 | ralrimivva 3184 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ dom 𝐹((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → 𝑥 = 𝑦)) |
| 20 | 2fveq3 6836 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑦))) | |
| 21 | 20 | imaeq2d 6019 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑁 “ (𝐼‘(𝐹‘𝑥))) = (𝑁 “ (𝐼‘(𝐹‘𝑦)))) |
| 22 | 21 | fveq2d 6835 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦))))) |
| 23 | 6, 22 | f1mpt 7209 | . . . . 5 ⊢ (𝐸:dom 𝐹–1-1→dom 𝐽 ↔ (∀𝑥 ∈ dom 𝐹(◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) ∈ dom 𝐽 ∧ ∀𝑥 ∈ dom 𝐹∀𝑦 ∈ dom 𝐹((◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥)))) = (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑦)))) → 𝑥 = 𝑦))) |
| 24 | 17, 19, 23 | sylanbrc 590 | . . . 4 ⊢ (𝜑 → 𝐸:dom 𝐹–1-1→dom 𝐽) |
| 25 | eqidd 2742 | . . . . 5 ⊢ (𝜑 → 𝐸 = 𝐸) | |
| 26 | 1 | wlkf 29705 | . . . . . . . . 9 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 27 | 7, 8, 26 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 28 | 1, 2, 3, 4, 5, 6, 27 | upgrimwlklem1 48402 | . . . . . . 7 ⊢ (𝜑 → (♯‘𝐸) = (♯‘𝐹)) |
| 29 | 28 | oveq2d 7376 | . . . . . 6 ⊢ (𝜑 → (0..^(♯‘𝐸)) = (0..^(♯‘𝐹))) |
| 30 | wrddm 14478 | . . . . . . . 8 ⊢ (𝐹 ∈ Word dom 𝐼 → dom 𝐹 = (0..^(♯‘𝐹))) | |
| 31 | 8, 26, 30 | 3syl 18 | . . . . . . 7 ⊢ (𝐹(Trails‘𝐺)𝑃 → dom 𝐹 = (0..^(♯‘𝐹))) |
| 32 | 7, 31 | syl 17 | . . . . . 6 ⊢ (𝜑 → dom 𝐹 = (0..^(♯‘𝐹))) |
| 33 | 29, 32 | eqtr4d 2779 | . . . . 5 ⊢ (𝜑 → (0..^(♯‘𝐸)) = dom 𝐹) |
| 34 | eqidd 2742 | . . . . 5 ⊢ (𝜑 → dom 𝐽 = dom 𝐽) | |
| 35 | 25, 33, 34 | f1eq123d 6763 | . . . 4 ⊢ (𝜑 → (𝐸:(0..^(♯‘𝐸))–1-1→dom 𝐽 ↔ 𝐸:dom 𝐹–1-1→dom 𝐽)) |
| 36 | 24, 35 | mpbird 259 | . . 3 ⊢ (𝜑 → 𝐸:(0..^(♯‘𝐸))–1-1→dom 𝐽) |
| 37 | df-f1 6494 | . . . 4 ⊢ (𝐸:(0..^(♯‘𝐸))–1-1→dom 𝐽 ↔ (𝐸:(0..^(♯‘𝐸))⟶dom 𝐽 ∧ Fun ◡𝐸)) | |
| 38 | 37 | simprbi 499 | . . 3 ⊢ (𝐸:(0..^(♯‘𝐸))–1-1→dom 𝐽 → Fun ◡𝐸) |
| 39 | 36, 38 | syl 17 | . 2 ⊢ (𝜑 → Fun ◡𝐸) |
| 40 | istrl 29785 | . 2 ⊢ (𝐸(Trails‘𝐻)(𝑁 ∘ 𝑃) ↔ (𝐸(Walks‘𝐻)(𝑁 ∘ 𝑃) ∧ Fun ◡𝐸)) | |
| 41 | 10, 39, 40 | sylanbrc 590 | 1 ⊢ (𝜑 → 𝐸(Trails‘𝐻)(𝑁 ∘ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∀wral 3055 class class class wbr 5075 ↦ cmpt 5156 ◡ccnv 5620 dom cdm 5621 “ cima 5624 ∘ ccom 5625 Fun wfun 6483 ⟶wf 6485 –1-1→wf1 6486 –1-1-onto→wf1o 6488 ‘cfv 6489 (class class class)co 7360 0cc0 11033 ..^cfzo 13603 ♯chash 14287 Word cword 14470 iEdgciedg 29088 Edgcedg 29138 USPGraphcuspgr 29239 Walkscwlks 29687 Trailsctrls 29779 GraphIso cgrim 48380 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-ifp 1070 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-er 8637 df-map 8769 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9820 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-n0 12433 df-xnn0 12506 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-hash 14288 df-word 14471 df-edg 29139 df-uhgr 29149 df-upgr 29173 df-uspgr 29241 df-wlks 29690 df-trls 29781 df-grim 48383 |
| This theorem is referenced by: upgrimpths 48414 upgrimspths 48415 |
| Copyright terms: Public domain | W3C validator |