Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clwlkclwwlkfolem | Structured version Visualization version GIF version |
Description: Lemma for clwlkclwwlkfo 27794. (Contributed by AV, 25-May-2022.) |
Ref | Expression |
---|---|
clwlkclwwlkf.c | ⊢ 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))} |
Ref | Expression |
---|---|
clwlkclwwlkfolem | ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1135 | . 2 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) | |
2 | wrdlenccats1lenm1 13967 | . . . . . . 7 ⊢ (𝑊 ∈ Word (Vtx‘𝐺) → ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1) = (♯‘𝑊)) | |
3 | 2 | eqcomd 2804 | . . . . . 6 ⊢ (𝑊 ∈ Word (Vtx‘𝐺) → (♯‘𝑊) = ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
4 | 3 | breq2d 5042 | . . . . 5 ⊢ (𝑊 ∈ Word (Vtx‘𝐺) → (1 ≤ (♯‘𝑊) ↔ 1 ≤ ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1))) |
5 | 4 | biimpa 480 | . . . 4 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊)) → 1 ≤ ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
6 | 5 | 3adant3 1129 | . . 3 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → 1 ≤ ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
7 | df-br 5031 | . . . . 5 ⊢ (𝑓(ClWalks‘𝐺)(𝑊 ++ 〈“(𝑊‘0)”〉) ↔ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) | |
8 | clwlkiswlk 27563 | . . . . . 6 ⊢ (𝑓(ClWalks‘𝐺)(𝑊 ++ 〈“(𝑊‘0)”〉) → 𝑓(Walks‘𝐺)(𝑊 ++ 〈“(𝑊‘0)”〉)) | |
9 | wlklenvm1 27411 | . . . . . 6 ⊢ (𝑓(Walks‘𝐺)(𝑊 ++ 〈“(𝑊‘0)”〉) → (♯‘𝑓) = ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) | |
10 | 8, 9 | syl 17 | . . . . 5 ⊢ (𝑓(ClWalks‘𝐺)(𝑊 ++ 〈“(𝑊‘0)”〉) → (♯‘𝑓) = ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
11 | 7, 10 | sylbir 238 | . . . 4 ⊢ (〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺) → (♯‘𝑓) = ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
12 | 11 | 3ad2ant3 1132 | . . 3 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → (♯‘𝑓) = ((♯‘(𝑊 ++ 〈“(𝑊‘0)”〉)) − 1)) |
13 | 6, 12 | breqtrrd 5058 | . 2 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → 1 ≤ (♯‘𝑓)) |
14 | vex 3444 | . . . . . 6 ⊢ 𝑓 ∈ V | |
15 | ovex 7168 | . . . . . 6 ⊢ (𝑊 ++ 〈“(𝑊‘0)”〉) ∈ V | |
16 | 14, 15 | op1std 7681 | . . . . 5 ⊢ (𝑐 = 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 → (1st ‘𝑐) = 𝑓) |
17 | 16 | fveq2d 6649 | . . . 4 ⊢ (𝑐 = 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 → (♯‘(1st ‘𝑐)) = (♯‘𝑓)) |
18 | 17 | breq2d 5042 | . . 3 ⊢ (𝑐 = 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 → (1 ≤ (♯‘(1st ‘𝑐)) ↔ 1 ≤ (♯‘𝑓))) |
19 | clwlkclwwlkf.c | . . . 4 ⊢ 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))} | |
20 | 2fveq3 6650 | . . . . . 6 ⊢ (𝑤 = 𝑐 → (♯‘(1st ‘𝑤)) = (♯‘(1st ‘𝑐))) | |
21 | 20 | breq2d 5042 | . . . . 5 ⊢ (𝑤 = 𝑐 → (1 ≤ (♯‘(1st ‘𝑤)) ↔ 1 ≤ (♯‘(1st ‘𝑐)))) |
22 | 21 | cbvrabv 3439 | . . . 4 ⊢ {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))} = {𝑐 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑐))} |
23 | 19, 22 | eqtri 2821 | . . 3 ⊢ 𝐶 = {𝑐 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑐))} |
24 | 18, 23 | elrab2 3631 | . 2 ⊢ (〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ 𝐶 ↔ (〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺) ∧ 1 ≤ (♯‘𝑓))) |
25 | 1, 13, 24 | sylanbrc 586 | 1 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 1 ≤ (♯‘𝑊) ∧ 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ (ClWalks‘𝐺)) → 〈𝑓, (𝑊 ++ 〈“(𝑊‘0)”〉)〉 ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 {crab 3110 〈cop 4531 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 1st c1st 7669 0cc0 10526 1c1 10527 ≤ cle 10665 − cmin 10859 ♯chash 13686 Word cword 13857 ++ cconcat 13913 〈“cs1 13940 Vtxcvtx 26789 Walkscwlks 27386 ClWalkscclwlks 27559 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ifp 1059 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-concat 13914 df-s1 13941 df-wlks 27389 df-clwlks 27560 |
This theorem is referenced by: clwlkclwwlkfo 27794 |
Copyright terms: Public domain | W3C validator |