| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wlkp1lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkp1 29938. (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 | ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) |
| Ref | Expression |
|---|---|
| wlkp1lem2 | ⊢ (𝜑 → (♯‘𝐻) = (𝑁 + 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wlkp1.h | . . . 4 ⊢ 𝐻 = (𝐹 ∪ {〈𝑁, 𝐵〉}) | |
| 2 | 1 | fveq2i 6874 | . . 3 ⊢ (♯‘𝐻) = (♯‘(𝐹 ∪ {〈𝑁, 𝐵〉})) |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝜑 → (♯‘𝐻) = (♯‘(𝐹 ∪ {〈𝑁, 𝐵〉}))) |
| 4 | opex 5436 | . . 3 ⊢ 〈𝑁, 𝐵〉 ∈ V | |
| 5 | wlkp1.w | . . . . 5 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) | |
| 6 | wlkp1.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | wlkf 29873 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 8 | wrdfin 14559 | . . . . 5 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹 ∈ Fin) | |
| 9 | 5, 7, 8 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Fin) |
| 10 | wlkp1.n | . . . . . 6 ⊢ 𝑁 = (♯‘𝐹) | |
| 11 | fzonel 13693 | . . . . . . . 8 ⊢ ¬ (♯‘𝐹) ∈ (0..^(♯‘𝐹)) | |
| 12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ¬ (♯‘𝐹) ∈ (0..^(♯‘𝐹))) |
| 13 | eleq1 2853 | . . . . . . . 8 ⊢ (𝑁 = (♯‘𝐹) → (𝑁 ∈ (0..^(♯‘𝐹)) ↔ (♯‘𝐹) ∈ (0..^(♯‘𝐹)))) | |
| 14 | 13 | notbid 321 | . . . . . . 7 ⊢ (𝑁 = (♯‘𝐹) → (¬ 𝑁 ∈ (0..^(♯‘𝐹)) ↔ ¬ (♯‘𝐹) ∈ (0..^(♯‘𝐹)))) |
| 15 | 12, 14 | imbitrrid 249 | . . . . . 6 ⊢ (𝑁 = (♯‘𝐹) → (𝜑 → ¬ 𝑁 ∈ (0..^(♯‘𝐹)))) |
| 16 | 10, 15 | ax-mp 5 | . . . . 5 ⊢ (𝜑 → ¬ 𝑁 ∈ (0..^(♯‘𝐹))) |
| 17 | wrdfn 14555 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹 Fn (0..^(♯‘𝐹))) | |
| 18 | fnop 6634 | . . . . . . 7 ⊢ ((𝐹 Fn (0..^(♯‘𝐹)) ∧ 〈𝑁, 𝐵〉 ∈ 𝐹) → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 19 | 18 | ex 417 | . . . . . 6 ⊢ (𝐹 Fn (0..^(♯‘𝐹)) → (〈𝑁, 𝐵〉 ∈ 𝐹 → 𝑁 ∈ (0..^(♯‘𝐹)))) |
| 20 | 5, 7, 17, 19 | 4syl 20 | . . . . 5 ⊢ (𝜑 → (〈𝑁, 𝐵〉 ∈ 𝐹 → 𝑁 ∈ (0..^(♯‘𝐹)))) |
| 21 | 16, 20 | mtod 201 | . . . 4 ⊢ (𝜑 → ¬ 〈𝑁, 𝐵〉 ∈ 𝐹) |
| 22 | 9, 21 | jca 520 | . . 3 ⊢ (𝜑 → (𝐹 ∈ Fin ∧ ¬ 〈𝑁, 𝐵〉 ∈ 𝐹)) |
| 23 | hashunsng 14419 | . . 3 ⊢ (〈𝑁, 𝐵〉 ∈ V → ((𝐹 ∈ Fin ∧ ¬ 〈𝑁, 𝐵〉 ∈ 𝐹) → (♯‘(𝐹 ∪ {〈𝑁, 𝐵〉})) = ((♯‘𝐹) + 1))) | |
| 24 | 4, 22, 23 | mpsyl 69 | . 2 ⊢ (𝜑 → (♯‘(𝐹 ∪ {〈𝑁, 𝐵〉})) = ((♯‘𝐹) + 1)) |
| 25 | 10 | eqcomi 2774 | . . . 4 ⊢ (♯‘𝐹) = 𝑁 |
| 26 | 25 | a1i 11 | . . 3 ⊢ (𝜑 → (♯‘𝐹) = 𝑁) |
| 27 | 26 | oveq1d 7415 | . 2 ⊢ (𝜑 → ((♯‘𝐹) + 1) = (𝑁 + 1)) |
| 28 | 3, 24, 27 | 3eqtrd 2804 | 1 ⊢ (𝜑 → (♯‘𝐻) = (𝑁 + 1)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ∪ cun 3905 ⊆ wss 3907 {csn 4585 {cpr 4587 〈cop 4591 class class class wbr 5105 dom cdm 5652 Fun wfun 6519 Fn wfn 6520 ‘cfv 6525 (class class class)co 7400 Fincfn 8931 0cc0 11088 1c1 11089 + caddc 11091 ..^cfzo 13673 ♯chash 14357 Word cword 14540 Vtxcvtx 29255 iEdgciedg 29256 Edgcedg 29306 Walkscwlks 29855 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1077 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-oadd 8445 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-fzo 13674 df-hash 14358 df-word 14541 df-wlks 29858 |
| This theorem is referenced by: wlkp1lem8 29937 wlkp1 29938 eupthp1 30476 |
| Copyright terms: Public domain | W3C validator |