| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > upgrimpthslem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for upgrimpths 49340. (Contributed by AV, 30-Oct-2025.) |
| Ref | Expression |
|---|---|
| upgrimwlk.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| upgrimwlk.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| upgrimwlk.g | ⊢ (𝜑 → 𝐺 ∈ USPGraph) |
| upgrimwlk.h | ⊢ (𝜑 → 𝐻 ∈ USPGraph) |
| upgrimwlk.n | ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) |
| upgrimwlk.e | ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) |
| upgrimpths.p | ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| Ref | Expression |
|---|---|
| upgrimpthslem1 | ⊢ (𝜑 → Fun ◡((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgrimpths.p | . . . 4 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) | |
| 2 | ispth 30365 | . . . . 5 ⊢ (𝐹(Paths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ Fun ◡(𝑃 ↾ (1..^(♯‘𝐹))) ∧ ((𝑃 “ {0, (♯‘𝐹)}) ∩ (𝑃 “ (1..^(♯‘𝐹)))) = ∅)) | |
| 3 | 2 | simp2bi 1165 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → Fun ◡(𝑃 ↾ (1..^(♯‘𝐹)))) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (𝜑 → Fun ◡(𝑃 ↾ (1..^(♯‘𝐹)))) |
| 5 | upgrimwlk.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) | |
| 6 | eqid 2766 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 7 | eqid 2766 | . . . . 5 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 8 | 6, 7 | grimf1o 49315 | . . . 4 ⊢ (𝑁 ∈ (𝐺 GraphIso 𝐻) → 𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻)) |
| 9 | dff1o3 6860 | . . . . 5 ⊢ (𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ↔ (𝑁:(Vtx‘𝐺)⟶onto(Vtx‘𝐻) ∧ Fun ◡𝑁)) | |
| 10 | 9 | simprbi 503 | . . . 4 ⊢ (𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) → Fun ◡𝑁) |
| 11 | 5, 8, 10 | 3syl 19 | . . 3 ⊢ (𝜑 → Fun ◡𝑁) |
| 12 | funco 6607 | . . 3 ⊢ ((Fun ◡(𝑃 ↾ (1..^(♯‘𝐹))) ∧ Fun ◡𝑁) → Fun (◡(𝑃 ↾ (1..^(♯‘𝐹))) ∘ ◡𝑁)) | |
| 13 | 4, 11, 12 | syl2anc 596 | . 2 ⊢ (𝜑 → Fun (◡(𝑃 ↾ (1..^(♯‘𝐹))) ∘ ◡𝑁)) |
| 14 | resco 6269 | . . . . 5 ⊢ ((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹))) = (𝑁 ∘ (𝑃 ↾ (1..^(♯‘𝐹)))) | |
| 15 | 14 | cnveqi 5863 | . . . 4 ⊢ ◡((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹))) = ◡(𝑁 ∘ (𝑃 ↾ (1..^(♯‘𝐹)))) |
| 16 | cnvco 5878 | . . . 4 ⊢ ◡(𝑁 ∘ (𝑃 ↾ (1..^(♯‘𝐹)))) = (◡(𝑃 ↾ (1..^(♯‘𝐹))) ∘ ◡𝑁) | |
| 17 | 15, 16 | eqtri 2789 | . . 3 ⊢ ◡((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹))) = (◡(𝑃 ↾ (1..^(♯‘𝐹))) ∘ ◡𝑁) |
| 18 | 17 | funeqi 6587 | . 2 ⊢ (Fun ◡((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹))) ↔ Fun (◡(𝑃 ↾ (1..^(♯‘𝐹))) ∘ ◡𝑁)) |
| 19 | 13, 18 | sylibr 237 | 1 ⊢ (𝜑 → Fun ◡((𝑁 ∘ 𝑃) ↾ (1..^(♯‘𝐹)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 ∩ cin 4091 ∅c0 4280 {cpr 4589 class class class wbr 5107 ↦ cmpt 5191 ◡ccnv 5656 dom cdm 5657 ↾ cres 5659 “ cima 5660 ∘ ccom 5661 Fun wfun 6559 ⟶ontowfo 6563 ⟶1-1ontowf1o 6564 ‘cfv 6565 (class class class)co 7450 0cc0 11238 1c1 11239 ..^cfzo 13827 ♯chash 14514 Vtxcvtx 29633 iEdgciedg 29634 USPGraphcuspgr 29788 Trailsctrls 30332 Pathscpths 30354 GraphIso cgrim 49306 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-map 8886 df-trls 30334 df-pths 30358 df-grim 49309 |
| This theorem is used by: upgrimpths 49340 |
| Copyright terms: Public domain | W3C validator |