| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkp1lem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkp1 29773. (Contributed by AV, 6-Mar-2021.) |
| Ref | Expression |
|---|---|
| wlkp1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| wlkp1.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| wlkp1.f | ⊢ (𝜑 → Fun 𝐼) |
| wlkp1.a | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| wlkp1.b | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| wlkp1.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| wlkp1.d | ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼) |
| wlkp1.w | ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| wlkp1.n | ⊢ 𝑁 = (♯‘𝐹) |
| wlkp1.e | ⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺)) |
| wlkp1.x | ⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸) |
| wlkp1.u | ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {〈𝐵, 𝐸〉})) |
| wlkp1.h | ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) |
| wlkp1.q | ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) |
| wlkp1.s | ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) |
| Ref | Expression |
|---|---|
| wlkp1lem7 | ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wlkp1.x | . . 3 ⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸) | |
| 2 | fveq2 6834 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝑄‘𝑘) = (𝑄‘𝑁)) | |
| 3 | fveq2 6834 | . . . . . 6 ⊢ (𝑘 = 𝑁 → (𝑃‘𝑘) = (𝑃‘𝑁)) | |
| 4 | 2, 3 | eqeq12d 2756 | . . . . 5 ⊢ (𝑘 = 𝑁 → ((𝑄‘𝑘) = (𝑃‘𝑘) ↔ (𝑄‘𝑁) = (𝑃‘𝑁))) |
| 5 | wlkp1.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 6 | wlkp1.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | wlkp1.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 8 | wlkp1.a | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ Fin) | |
| 9 | wlkp1.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 10 | wlkp1.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 11 | wlkp1.d | . . . . . 6 ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼) | |
| 12 | wlkp1.w | . . . . . 6 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | wlkp1.n | . . . . . 6 ⊢ 𝑁 = (♯‘𝐹) | |
| 14 | wlkp1.e | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺)) | |
| 15 | wlkp1.u | . . . . . 6 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {〈𝐵, 𝐸〉})) | |
| 16 | wlkp1.h | . . . . . 6 ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) | |
| 17 | wlkp1.q | . . . . . 6 ⊢ 𝑄 = (𝑃 ∪ {〈(𝑁 + 1), 𝐶〉}) | |
| 18 | wlkp1.s | . . . . . 6 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) | |
| 19 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 1, 15, 16, 17, 18 | wlkp1lem5 29769 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (0...𝑁)(𝑄‘𝑘) = (𝑃‘𝑘)) |
| 20 | wlkcl 29709 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 21 | 13 | eqcomi 2749 | . . . . . . . 8 ⊢ (♯‘𝐹) = 𝑁 |
| 22 | 21 | eleq1i 2831 | . . . . . . 7 ⊢ ((♯‘𝐹) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0) |
| 23 | nn0fz0 13577 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (0...𝑁)) | |
| 24 | 22, 23 | sylbb 220 | . . . . . 6 ⊢ ((♯‘𝐹) ∈ ℕ0 → 𝑁 ∈ (0...𝑁)) |
| 25 | 12, 20, 24 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...𝑁)) |
| 26 | 4, 19, 25 | rspcdva 3568 | . . . 4 ⊢ (𝜑 → (𝑄‘𝑁) = (𝑃‘𝑁)) |
| 27 | 17 | fveq1i 6835 | . . . . 5 ⊢ (𝑄‘(𝑁 + 1)) = ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) |
| 28 | ovex 7396 | . . . . . 6 ⊢ (𝑁 + 1) ∈ V | |
| 29 | 5, 6, 7, 8, 9, 10, 11, 12, 13 | wlkp1lem1 29765 | . . . . . 6 ⊢ (𝜑 → ¬ (𝑁 + 1) ∈ dom 𝑃) |
| 30 | fsnunfv 7138 | . . . . . 6 ⊢ (((𝑁 + 1) ∈ V ∧ 𝐶 ∈ 𝑉 ∧ ¬ (𝑁 + 1) ∈ dom 𝑃) → ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) = 𝐶) | |
| 31 | 28, 10, 29, 30 | mp3an2i 1474 | . . . . 5 ⊢ (𝜑 → ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) = 𝐶) |
| 32 | 27, 31 | eqtrid 2787 | . . . 4 ⊢ (𝜑 → (𝑄‘(𝑁 + 1)) = 𝐶) |
| 33 | 26, 32 | preq12d 4680 | . . 3 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} = {(𝑃‘𝑁), 𝐶}) |
| 34 | fsnunfv 7138 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐸 ∈ (Edg‘𝐺) ∧ ¬ 𝐵 ∈ dom 𝐼) → ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵) = 𝐸) | |
| 35 | 9, 14, 11, 34 | syl3anc 1379 | . . 3 ⊢ (𝜑 → ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵) = 𝐸) |
| 36 | 1, 33, 35 | 3sstr4d 3977 | . 2 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} ⊆ ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵)) |
| 37 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 1, 15, 16 | wlkp1lem3 29767 | . 2 ⊢ (𝜑 → ((iEdg‘𝑆)‘(𝐻‘𝑁)) = ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵)) |
| 38 | 36, 37 | sseqtrrd 3959 | 1 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1547 ∈ wcel 2119 Vcvv 3432 ∪ cun 3888 ⊆ wss 3890 {csn 4562 {cpr 4564 〈cop 4568 class class class wbr 5079 dom cdm 5625 Fun wfun 6486 ‘cfv 6492 (class class class)co 7363 Fincfn 8890 0cc0 11036 1c1 11037 + caddc 11039 ℕ0cn0 12435 ...cfz 13459 ♯chash 14290 Vtxcvtx 29090 iEdgciedg 29091 Edgcedg 29141 Walkscwlks 29690 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-ifp 1069 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-er 8640 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-card 9861 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-n0 12436 df-z 12523 df-uz 12787 df-fz 13460 df-fzo 13607 df-hash 14291 df-word 14474 df-wlks 29693 |
| This theorem is referenced by: wlkp1lem8 29772 |
| Copyright terms: Public domain | W3C validator |