| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkp1lem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkp1 29763. (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 2753 | . . . . 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 29759 | . . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ (0...𝑁)(𝑄‘𝑘) = (𝑃‘𝑘)) |
| 20 | wlkcl 29699 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 21 | 13 | eqcomi 2746 | . . . . . . . 8 ⊢ (♯‘𝐹) = 𝑁 |
| 22 | 21 | eleq1i 2828 | . . . . . . 7 ⊢ ((♯‘𝐹) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0) |
| 23 | nn0fz0 13570 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (0...𝑁)) | |
| 24 | 22, 23 | sylbb 219 | . . . . . 6 ⊢ ((♯‘𝐹) ∈ ℕ0 → 𝑁 ∈ (0...𝑁)) |
| 25 | 12, 20, 24 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...𝑁)) |
| 26 | 4, 19, 25 | rspcdva 3566 | . . . 4 ⊢ (𝜑 → (𝑄‘𝑁) = (𝑃‘𝑁)) |
| 27 | 17 | fveq1i 6835 | . . . . 5 ⊢ (𝑄‘(𝑁 + 1)) = ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) |
| 28 | ovex 7393 | . . . . . 6 ⊢ (𝑁 + 1) ∈ V | |
| 29 | 5, 6, 7, 8, 9, 10, 11, 12, 13 | wlkp1lem1 29755 | . . . . . 6 ⊢ (𝜑 → ¬ (𝑁 + 1) ∈ dom 𝑃) |
| 30 | fsnunfv 7135 | . . . . . 6 ⊢ (((𝑁 + 1) ∈ V ∧ 𝐶 ∈ 𝑉 ∧ ¬ (𝑁 + 1) ∈ dom 𝑃) → ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) = 𝐶) | |
| 31 | 28, 10, 29, 30 | mp3an2i 1469 | . . . . 5 ⊢ (𝜑 → ((𝑃 ∪ {〈(𝑁 + 1), 𝐶〉})‘(𝑁 + 1)) = 𝐶) |
| 32 | 27, 31 | eqtrid 2784 | . . . 4 ⊢ (𝜑 → (𝑄‘(𝑁 + 1)) = 𝐶) |
| 33 | 26, 32 | preq12d 4686 | . . 3 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} = {(𝑃‘𝑁), 𝐶}) |
| 34 | fsnunfv 7135 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐸 ∈ (Edg‘𝐺) ∧ ¬ 𝐵 ∈ dom 𝐼) → ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵) = 𝐸) | |
| 35 | 9, 14, 11, 34 | syl3anc 1374 | . . 3 ⊢ (𝜑 → ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵) = 𝐸) |
| 36 | 1, 33, 35 | 3sstr4d 3978 | . 2 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} ⊆ ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵)) |
| 37 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 1, 15, 16 | wlkp1lem3 29757 | . 2 ⊢ (𝜑 → ((iEdg‘𝑆)‘(𝐻‘𝑁)) = ((𝐼 ∪ {〈𝐵, 𝐸〉})‘𝐵)) |
| 38 | 36, 37 | sseqtrrd 3960 | 1 ⊢ (𝜑 → {(𝑄‘𝑁), (𝑄‘(𝑁 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∪ cun 3888 ⊆ wss 3890 {csn 4568 {cpr 4570 〈cop 4574 class class class wbr 5086 dom cdm 5624 Fun wfun 6486 ‘cfv 6492 (class class class)co 7360 Fincfn 8886 0cc0 11029 1c1 11030 + caddc 11032 ℕ0cn0 12428 ...cfz 13452 ♯chash 14283 Vtxcvtx 29079 iEdgciedg 29080 Edgcedg 29130 Walkscwlks 29680 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-hash 14284 df-word 14467 df-wlks 29683 |
| This theorem is referenced by: wlkp1lem8 29762 |
| Copyright terms: Public domain | W3C validator |