![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > numclwwlk1lem2f | Structured version Visualization version GIF version |
Description: 𝑇 is a function, mapping a double loop of length 𝑁 on vertex 𝑋 to the ordered pair of the first loop and the successor of 𝑋 in the second loop, which must be a neighbor of 𝑋. (Contributed by Alexander van der Vekens, 19-Sep-2018.) (Revised by AV, 29-May-2021.) (Proof shortened by AV, 23-Feb-2022.) (Revised by AV, 31-Oct-2022.) |
Ref | Expression |
---|---|
extwwlkfab.v | ⊢ 𝑉 = (Vtx‘𝐺) |
extwwlkfab.c | ⊢ 𝐶 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣}) |
extwwlkfab.f | ⊢ 𝐹 = (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) |
numclwwlk.t | ⊢ 𝑇 = (𝑢 ∈ (𝑋𝐶𝑁) ↦ 〈(𝑢 prefix (𝑁 − 2)), (𝑢‘(𝑁 − 1))〉) |
Ref | Expression |
---|---|
numclwwlk1lem2f | ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → 𝑇:(𝑋𝐶𝑁)⟶(𝐹 × (𝐺 NeighbVtx 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | extwwlkfab.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | extwwlkfab.c | . . . . 5 ⊢ 𝐶 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) = 𝑣}) | |
3 | extwwlkfab.f | . . . . 5 ⊢ 𝐹 = (𝑋(ClWWalksNOn‘𝐺)(𝑁 − 2)) | |
4 | 1, 2, 3 | extwwlkfabel 29401 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑢 ∈ (𝑋𝐶𝑁) ↔ (𝑢 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑢 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑢‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑢‘(𝑁 − 2)) = 𝑋)))) |
5 | simpr1 1194 | . . . . 5 ⊢ ((𝑢 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑢 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑢‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑢‘(𝑁 − 2)) = 𝑋)) → (𝑢 prefix (𝑁 − 2)) ∈ 𝐹) | |
6 | simpr2 1195 | . . . . 5 ⊢ ((𝑢 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑢 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑢‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑢‘(𝑁 − 2)) = 𝑋)) → (𝑢‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋)) | |
7 | 5, 6 | opelxpd 5698 | . . . 4 ⊢ ((𝑢 ∈ (𝑁 ClWWalksN 𝐺) ∧ ((𝑢 prefix (𝑁 − 2)) ∈ 𝐹 ∧ (𝑢‘(𝑁 − 1)) ∈ (𝐺 NeighbVtx 𝑋) ∧ (𝑢‘(𝑁 − 2)) = 𝑋)) → 〈(𝑢 prefix (𝑁 − 2)), (𝑢‘(𝑁 − 1))〉 ∈ (𝐹 × (𝐺 NeighbVtx 𝑋))) |
8 | 4, 7 | syl6bi 252 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → (𝑢 ∈ (𝑋𝐶𝑁) → 〈(𝑢 prefix (𝑁 − 2)), (𝑢‘(𝑁 − 1))〉 ∈ (𝐹 × (𝐺 NeighbVtx 𝑋)))) |
9 | 8 | imp 407 | . 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) ∧ 𝑢 ∈ (𝑋𝐶𝑁)) → 〈(𝑢 prefix (𝑁 − 2)), (𝑢‘(𝑁 − 1))〉 ∈ (𝐹 × (𝐺 NeighbVtx 𝑋))) |
10 | numclwwlk.t | . 2 ⊢ 𝑇 = (𝑢 ∈ (𝑋𝐶𝑁) ↦ 〈(𝑢 prefix (𝑁 − 2)), (𝑢‘(𝑁 − 1))〉) | |
11 | 9, 10 | fmptd 7089 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (ℤ≥‘3)) → 𝑇:(𝑋𝐶𝑁)⟶(𝐹 × (𝐺 NeighbVtx 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 {crab 3425 〈cop 4619 ↦ cmpt 5215 × cxp 5658 ⟶wf 6519 ‘cfv 6523 (class class class)co 7384 ∈ cmpo 7386 1c1 11083 − cmin 11416 2c2 12239 3c3 12240 ℤ≥cuz 12794 prefix cpfx 14592 Vtxcvtx 28051 USGraphcusgr 28204 NeighbVtx cnbgr 28384 ClWWalksN cclwwlkn 29072 ClWWalksNOncclwwlknon 29135 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5269 ax-sep 5283 ax-nul 5290 ax-pow 5347 ax-pr 5411 ax-un 7699 ax-cnex 11138 ax-resscn 11139 ax-1cn 11140 ax-icn 11141 ax-addcl 11142 ax-addrcl 11143 ax-mulcl 11144 ax-mulrcl 11145 ax-mulcom 11146 ax-addass 11147 ax-mulass 11148 ax-distr 11149 ax-i2m1 11150 ax-1ne0 11151 ax-1rid 11152 ax-rnegex 11153 ax-rrecex 11154 ax-cnre 11155 ax-pre-lttri 11156 ax-pre-lttrn 11157 ax-pre-ltadd 11158 ax-pre-mulgt0 11159 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3372 df-rab 3426 df-v 3468 df-sbc 3765 df-csb 3881 df-dif 3938 df-un 3940 df-in 3942 df-ss 3952 df-pss 3954 df-nul 4310 df-if 4514 df-pw 4589 df-sn 4614 df-pr 4616 df-op 4620 df-uni 4893 df-int 4935 df-iun 4983 df-br 5133 df-opab 5195 df-mpt 5216 df-tr 5250 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5615 df-we 5617 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6280 df-ord 6347 df-on 6348 df-lim 6349 df-suc 6350 df-iota 6475 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7340 df-ov 7387 df-oprab 7388 df-mpo 7389 df-om 7830 df-1st 7948 df-2nd 7949 df-frecs 8239 df-wrecs 8270 df-recs 8344 df-rdg 8383 df-1o 8439 df-2o 8440 df-oadd 8443 df-er 8677 df-map 8796 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-dju 9868 df-card 9906 df-pnf 11222 df-mnf 11223 df-xr 11224 df-ltxr 11225 df-le 11226 df-sub 11418 df-neg 11419 df-nn 12185 df-2 12247 df-3 12248 df-n0 12445 df-xnn0 12517 df-z 12531 df-uz 12795 df-fz 13457 df-fzo 13600 df-hash 14263 df-word 14437 df-lsw 14485 df-substr 14563 df-pfx 14593 df-edg 28103 df-upgr 28137 df-umgr 28138 df-usgr 28206 df-nbgr 28385 df-wwlks 28879 df-wwlksn 28880 df-clwwlk 29030 df-clwwlkn 29073 df-clwwlknon 29136 |
This theorem is referenced by: numclwwlk1lem2f1 29405 numclwwlk1lem2fo 29406 |
Copyright terms: Public domain | W3C validator |