Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  wwlksnextbijOLD Structured version   Visualization version   GIF version

Theorem wwlksnextbijOLD 27172
 Description: Obsolete version of wwlksnextbij 27171 as of 12-Oct-2022. (Contributed by Alexander van der Vekens, 21-Aug-2018.) (Revised by AV, 18-Apr-2021.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
wwlksnextbij.v 𝑉 = (Vtx‘𝐺)
wwlksnextbij.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
wwlksnextbijOLD (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∃𝑓 𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
Distinct variable groups:   𝑓,𝐸,𝑛,𝑤   𝑓,𝐺,𝑤   𝑓,𝑁,𝑤   𝑓,𝑉,𝑛,𝑤   𝑓,𝑊,𝑛,𝑤
Allowed substitution hints:   𝐺(𝑛)   𝑁(𝑛)

Proof of Theorem wwlksnextbijOLD
Dummy variables 𝑝 𝑡 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovexd 6910 . . 3 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑁 + 1) WWalksN 𝐺) ∈ V)
2 rabexg 5004 . . 3 (((𝑁 + 1) WWalksN 𝐺) ∈ V → {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ∈ V)
3 mptexg 6711 . . 3 ({𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ∈ V → (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)) ∈ V)
41, 2, 33syl 18 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)) ∈ V)
5 wwlksnextbij.v . . . 4 𝑉 = (Vtx‘𝐺)
6 wwlksnextbij.e . . . 4 𝐸 = (Edg‘𝐺)
7 eqid 2797 . . . 4 {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
8 preq2 4456 . . . . . 6 (𝑛 = 𝑝 → {(lastS‘𝑊), 𝑛} = {(lastS‘𝑊), 𝑝})
98eleq1d 2861 . . . . 5 (𝑛 = 𝑝 → ({(lastS‘𝑊), 𝑛} ∈ 𝐸 ↔ {(lastS‘𝑊), 𝑝} ∈ 𝐸))
109cbvrabv 3381 . . . 4 {𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸} = {𝑝𝑉 ∣ {(lastS‘𝑊), 𝑝} ∈ 𝐸}
11 fveqeq2 6418 . . . . . . 7 (𝑡 = 𝑤 → ((♯‘𝑡) = (𝑁 + 2) ↔ (♯‘𝑤) = (𝑁 + 2)))
12 oveq1 6883 . . . . . . . 8 (𝑡 = 𝑤 → (𝑡 substr ⟨0, (𝑁 + 1)⟩) = (𝑤 substr ⟨0, (𝑁 + 1)⟩))
1312eqeq1d 2799 . . . . . . 7 (𝑡 = 𝑤 → ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ↔ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊))
14 fveq2 6409 . . . . . . . . 9 (𝑡 = 𝑤 → (lastS‘𝑡) = (lastS‘𝑤))
1514preq2d 4462 . . . . . . . 8 (𝑡 = 𝑤 → {(lastS‘𝑊), (lastS‘𝑡)} = {(lastS‘𝑊), (lastS‘𝑤)})
1615eleq1d 2861 . . . . . . 7 (𝑡 = 𝑤 → ({(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))
1711, 13, 163anbi123d 1561 . . . . . 6 (𝑡 = 𝑤 → (((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸) ↔ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)))
1817cbvrabv 3381 . . . . 5 {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
1918mpteq1i 4930 . . . 4 (𝑥 ∈ {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)) = (𝑥 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ↦ (lastS‘𝑥))
205, 6, 7, 10, 19wwlksnextbij0OLD 27170 . . 3 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑥 ∈ {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)):{𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
21 eqid 2797 . . . . . . 7 {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} = {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)}
225, 6, 21wwlksnextwrdOLD 27166 . . . . . 6 (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} = {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)})
2322eqcomd 2803 . . . . 5 (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} = {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)})
2423mpteq1d 4929 . . . 4 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)) = (𝑥 ∈ {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)))
255, 6, 7wwlksnextwrdOLD 27166 . . . . 5 (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
2625eqcomd 2803 . . . 4 (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
27 eqidd 2798 . . . 4 (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸} = {𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
2824, 26, 27f1oeq123d 6349 . . 3 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)):{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸} ↔ (𝑥 ∈ {𝑡 ∈ Word 𝑉 ∣ ((♯‘𝑡) = (𝑁 + 2) ∧ (𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)):{𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}))
2920, 28mpbird 249 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)):{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
30 f1oeq1 6343 . 2 (𝑓 = (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)) → (𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸} ↔ (𝑥 ∈ {𝑡 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑡 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑡)} ∈ 𝐸)} ↦ (lastS‘𝑥)):{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}))
314, 29, 30elabd 3542 1 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∃𝑓 𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 substr ⟨0, (𝑁 + 1)⟩) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 385   ∧ w3a 1108   = wceq 1653  ∃wex 1875   ∈ wcel 2157  {crab 3091  Vcvv 3383  {cpr 4368  ⟨cop 4372   ↦ cmpt 4920  –1-1-onto→wf1o 6098  ‘cfv 6099  (class class class)co 6876  0cc0 10222  1c1 10223   + caddc 10225  2c2 11364  ♯chash 13366  Word cword 13530  lastSclsw 13578   substr csubstr 13661  Vtxcvtx 26223  Edgcedg 26274   WWalksN cwwlksn 27069 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2354  ax-ext 2775  ax-rep 4962  ax-sep 4973  ax-nul 4981  ax-pow 5033  ax-pr 5095  ax-un 7181  ax-cnex 10278  ax-resscn 10279  ax-1cn 10280  ax-icn 10281  ax-addcl 10282  ax-addrcl 10283  ax-mulcl 10284  ax-mulrcl 10285  ax-mulcom 10286  ax-addass 10287  ax-mulass 10288  ax-distr 10289  ax-i2m1 10290  ax-1ne0 10291  ax-1rid 10292  ax-rnegex 10293  ax-rrecex 10294  ax-cnre 10295  ax-pre-lttri 10296  ax-pre-lttrn 10297  ax-pre-ltadd 10298  ax-pre-mulgt0 10299 This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-fal 1667  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2590  df-eu 2607  df-clab 2784  df-cleq 2790  df-clel 2793  df-nfc 2928  df-ne 2970  df-nel 3073  df-ral 3092  df-rex 3093  df-reu 3094  df-rab 3096  df-v 3385  df-sbc 3632  df-csb 3727  df-dif 3770  df-un 3772  df-in 3774  df-ss 3781  df-pss 3783  df-nul 4114  df-if 4276  df-pw 4349  df-sn 4367  df-pr 4369  df-tp 4371  df-op 4373  df-uni 4627  df-int 4666  df-iun 4710  df-br 4842  df-opab 4904  df-mpt 4921  df-tr 4944  df-id 5218  df-eprel 5223  df-po 5231  df-so 5232  df-fr 5269  df-we 5271  df-xp 5316  df-rel 5317  df-cnv 5318  df-co 5319  df-dm 5320  df-rn 5321  df-res 5322  df-ima 5323  df-pred 5896  df-ord 5942  df-on 5943  df-lim 5944  df-suc 5945  df-iota 6062  df-fun 6101  df-fn 6102  df-f 6103  df-f1 6104  df-fo 6105  df-f1o 6106  df-fv 6107  df-riota 6837  df-ov 6879  df-oprab 6880  df-mpt2 6881  df-om 7298  df-1st 7399  df-2nd 7400  df-wrecs 7643  df-recs 7705  df-rdg 7743  df-1o 7797  df-oadd 7801  df-er 7980  df-map 8095  df-pm 8096  df-en 8194  df-dom 8195  df-sdom 8196  df-fin 8197  df-card 9049  df-pnf 10363  df-mnf 10364  df-xr 10365  df-ltxr 10366  df-le 10367  df-sub 10556  df-neg 10557  df-nn 11311  df-2 11372  df-n0 11577  df-xnn0 11649  df-z 11663  df-uz 11927  df-rp 12071  df-fz 12577  df-fzo 12717  df-hash 13367  df-word 13531  df-lsw 13579  df-concat 13587  df-s1 13612  df-substr 13662  df-pfx 13711  df-wwlks 27073  df-wwlksn 27074 This theorem is referenced by:  wwlksnexthasheqOLD  27174
 Copyright terms: Public domain W3C validator