Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wlkp1lem2 | Structured version Visualization version GIF version |
Description: Lemma for wlkp1 26578. (Contributed by AV, 6-Mar-2021.) |
Ref | Expression |
---|---|
wlkp1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
wlkp1.i | ⊢ 𝐼 = (iEdg‘𝐺) |
wlkp1.f | ⊢ (𝜑 → Fun 𝐼) |
wlkp1.a | ⊢ (𝜑 → 𝐼 ∈ Fin) |
wlkp1.b | ⊢ (𝜑 → 𝐵 ∈ V) |
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 6194 | . . 3 ⊢ (#‘𝐻) = (#‘(𝐹 ∪ {〈𝑁, 𝐵〉})) |
3 | 2 | a1i 11 | . 2 ⊢ (𝜑 → (#‘𝐻) = (#‘(𝐹 ∪ {〈𝑁, 𝐵〉}))) |
4 | opex 4932 | . . 3 ⊢ 〈𝑁, 𝐵〉 ∈ V | |
5 | wlkp1.w | . . . . 5 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) | |
6 | wlkp1.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
7 | 6 | wlkf 26510 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
8 | wrdfin 13323 | . . . . 5 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹 ∈ Fin) | |
9 | 5, 7, 8 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ Fin) |
10 | wlkp1.n | . . . . . 6 ⊢ 𝑁 = (#‘𝐹) | |
11 | fzonel 12483 | . . . . . . . 8 ⊢ ¬ (#‘𝐹) ∈ (0..^(#‘𝐹)) | |
12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ¬ (#‘𝐹) ∈ (0..^(#‘𝐹))) |
13 | eleq1 2689 | . . . . . . . 8 ⊢ (𝑁 = (#‘𝐹) → (𝑁 ∈ (0..^(#‘𝐹)) ↔ (#‘𝐹) ∈ (0..^(#‘𝐹)))) | |
14 | 13 | notbid 308 | . . . . . . 7 ⊢ (𝑁 = (#‘𝐹) → (¬ 𝑁 ∈ (0..^(#‘𝐹)) ↔ ¬ (#‘𝐹) ∈ (0..^(#‘𝐹)))) |
15 | 12, 14 | syl5ibr 236 | . . . . . 6 ⊢ (𝑁 = (#‘𝐹) → (𝜑 → ¬ 𝑁 ∈ (0..^(#‘𝐹)))) |
16 | 10, 15 | ax-mp 5 | . . . . 5 ⊢ (𝜑 → ¬ 𝑁 ∈ (0..^(#‘𝐹))) |
17 | wrdfn 13319 | . . . . . . 7 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹 Fn (0..^(#‘𝐹))) | |
18 | 5, 7, 17 | 3syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐹 Fn (0..^(#‘𝐹))) |
19 | fnop 5994 | . . . . . . 7 ⊢ ((𝐹 Fn (0..^(#‘𝐹)) ∧ 〈𝑁, 𝐵〉 ∈ 𝐹) → 𝑁 ∈ (0..^(#‘𝐹))) | |
20 | 19 | ex 450 | . . . . . 6 ⊢ (𝐹 Fn (0..^(#‘𝐹)) → (〈𝑁, 𝐵〉 ∈ 𝐹 → 𝑁 ∈ (0..^(#‘𝐹)))) |
21 | 18, 20 | syl 17 | . . . . 5 ⊢ (𝜑 → (〈𝑁, 𝐵〉 ∈ 𝐹 → 𝑁 ∈ (0..^(#‘𝐹)))) |
22 | 16, 21 | mtod 189 | . . . 4 ⊢ (𝜑 → ¬ 〈𝑁, 𝐵〉 ∈ 𝐹) |
23 | 9, 22 | jca 554 | . . 3 ⊢ (𝜑 → (𝐹 ∈ Fin ∧ ¬ 〈𝑁, 𝐵〉 ∈ 𝐹)) |
24 | hashunsng 13181 | . . 3 ⊢ (〈𝑁, 𝐵〉 ∈ V → ((𝐹 ∈ Fin ∧ ¬ 〈𝑁, 𝐵〉 ∈ 𝐹) → (#‘(𝐹 ∪ {〈𝑁, 𝐵〉})) = ((#‘𝐹) + 1))) | |
25 | 4, 23, 24 | mpsyl 68 | . 2 ⊢ (𝜑 → (#‘(𝐹 ∪ {〈𝑁, 𝐵〉})) = ((#‘𝐹) + 1)) |
26 | 10 | eqcomi 2631 | . . . 4 ⊢ (#‘𝐹) = 𝑁 |
27 | 26 | a1i 11 | . . 3 ⊢ (𝜑 → (#‘𝐹) = 𝑁) |
28 | 27 | oveq1d 6665 | . 2 ⊢ (𝜑 → ((#‘𝐹) + 1) = (𝑁 + 1)) |
29 | 3, 25, 28 | 3eqtrd 2660 | 1 ⊢ (𝜑 → (#‘𝐻) = (𝑁 + 1)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∪ cun 3572 ⊆ wss 3574 {csn 4177 {cpr 4179 〈cop 4183 class class class wbr 4653 dom cdm 5114 Fun wfun 5882 Fn wfn 5883 ‘cfv 5888 (class class class)co 6650 Fincfn 7955 0cc0 9936 1c1 9937 + caddc 9939 ..^cfzo 12465 #chash 13117 Word cword 13291 Vtxcvtx 25874 iEdgciedg 25875 Edgcedg 25939 Walkscwlks 26492 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-ifp 1013 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-wlks 26495 |
This theorem is referenced by: wlkp1lem8 26577 wlkp1 26578 eupthp1 27076 |
Copyright terms: Public domain | W3C validator |