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

Theorem clwlkclwwlkf 30658
Description: 𝐹 is a function from the nonempty closed walks into the closed walks as word in a simple pseudograph. (Contributed by AV, 23-May-2022.) (Revised by AV, 29-Oct-2022.)
Hypotheses
Ref Expression
clwlkclwwlkf.c 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))}
clwlkclwwlkf.f 𝐹 = (𝑐 ∈ 𝐶 ↦ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)))
Assertion
Ref Expression
clwlkclwwlkf (𝐺 ∈ USPGraph → 𝐹:𝐶⟶(ClWWalks‘𝐺))
Distinct variable groups:   𝑤,𝐺,𝑐   𝐶,𝑐
Allowed substitution hints:   𝐶(𝑤)   𝐹(𝑤, 𝑐)

Proof of Theorem clwlkclwwlkf
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 clwlkclwwlkf.c . . . . 5 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))}
2 eqid 2766 . . . . 5 (1st ‘𝑐) = (1st ‘𝑐)
3 eqid 2766 . . . . 5 (2nd ‘𝑐) = (2nd ‘𝑐)
41, 2, 3clwlkclwwlkflem 30654 . . . 4 (𝑐 ∈ 𝐶 → ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ))
5 isclwlk 30419 . . . . . . . 8 ((1st ‘𝑐)(ClWalks‘𝐺)(2nd ‘𝑐) ↔ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐)))))
6 fvex 6928 . . . . . . . . 9 (1st ‘𝑐) ∈ V
7 breq1 5110 . . . . . . . . 9 (𝑓 = (1st ‘𝑐) → (𝑓(ClWalks‘𝐺)(2nd ‘𝑐) ↔ (1st ‘𝑐)(ClWalks‘𝐺)(2nd ‘𝑐)))
86, 7spcev 3563 . . . . . . . 8 ((1st ‘𝑐)(ClWalks‘𝐺)(2nd ‘𝑐) → ∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐))
95, 8sylbir 238 . . . . . . 7 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐)))) → ∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐))
1093adant3 1151 . . . . . 6 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ) → ∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐))
1110adantl 487 . . . . 5 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → ∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐))
12 simpl 488 . . . . . 6 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → 𝐺 ∈ USPGraph)
13 eqid 2766 . . . . . . . . 9 (Vtx‘𝐺) = (Vtx‘𝐺)
1413wlkpwrd 30257 . . . . . . . 8 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
15143ad2ant1 1152 . . . . . . 7 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
1615adantl 487 . . . . . 6 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → (2nd ‘𝑐) ∈ Word (Vtx‘𝐺))
17 elnnnn0c 12690 . . . . . . . . . 10 ((♯‘(1st ‘𝑐)) ∈ ℕ ↔ ((♯‘(1st ‘𝑐)) ∈ ℕ0 ∧ 1 ≤ (♯‘(1st ‘𝑐))))
18 nn0re 12654 . . . . . . . . . . . . . 14 ((♯‘(1st ‘𝑐)) ∈ ℕ0 → (♯‘(1st ‘𝑐)) ∈ ℝ)
19 1e2m1 12508 . . . . . . . . . . . . . . . . 17 1 = (2 − 1)
2019breq1i 5114 . . . . . . . . . . . . . . . 16 (1 ≤ (♯‘(1st ‘𝑐)) ↔ (2 − 1) ≤ (♯‘(1st ‘𝑐)))
2120biimpi 219 . . . . . . . . . . . . . . 15 (1 ≤ (♯‘(1st ‘𝑐)) → (2 − 1) ≤ (♯‘(1st ‘𝑐)))
22 2re 12456 . . . . . . . . . . . . . . . 16 2 ∈ ℝ
23 1re 11346 . . . . . . . . . . . . . . . 16 1 ∈ ℝ
24 lesubadd 11827 . . . . . . . . . . . . . . . 16 ((2 ∈ ℝ ∧ 1 ∈ ℝ ∧ (♯‘(1st ‘𝑐)) ∈ ℝ) → ((2 − 1) ≤ (♯‘(1st ‘𝑐)) ↔ 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
2522, 23, 24mp3an12 1483 . . . . . . . . . . . . . . 15 ((♯‘(1st ‘𝑐)) ∈ ℝ → ((2 − 1) ≤ (♯‘(1st ‘𝑐)) ↔ 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
2621, 25imbitrid 247 . . . . . . . . . . . . . 14 ((♯‘(1st ‘𝑐)) ∈ ℝ → (1 ≤ (♯‘(1st ‘𝑐)) → 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
2718, 26syl 18 . . . . . . . . . . . . 13 ((♯‘(1st ‘𝑐)) ∈ ℕ0 → (1 ≤ (♯‘(1st ‘𝑐)) → 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
2827adantl 487 . . . . . . . . . . . 12 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ0) → (1 ≤ (♯‘(1st ‘𝑐)) → 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
29 wlklenvp1 30258 . . . . . . . . . . . . . 14 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (♯‘(2nd ‘𝑐)) = ((♯‘(1st ‘𝑐)) + 1))
3029adantr 486 . . . . . . . . . . . . 13 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ0) → (♯‘(2nd ‘𝑐)) = ((♯‘(1st ‘𝑐)) + 1))
3130breq2d 5119 . . . . . . . . . . . 12 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ0) → (2 ≤ (♯‘(2nd ‘𝑐)) ↔ 2 ≤ ((♯‘(1st ‘𝑐)) + 1)))
3228, 31sylibrd 262 . . . . . . . . . . 11 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ0) → (1 ≤ (♯‘(1st ‘𝑐)) → 2 ≤ (♯‘(2nd ‘𝑐))))
3332expimpd 459 . . . . . . . . . 10 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (((♯‘(1st ‘𝑐)) ∈ ℕ0 ∧ 1 ≤ (♯‘(1st ‘𝑐))) → 2 ≤ (♯‘(2nd ‘𝑐))))
3417, 33biimtrid 245 . . . . . . . . 9 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → ((♯‘(1st ‘𝑐)) ∈ ℕ → 2 ≤ (♯‘(2nd ‘𝑐))))
3534a1d 26 . . . . . . . 8 ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) → (((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) → ((♯‘(1st ‘𝑐)) ∈ ℕ → 2 ≤ (♯‘(2nd ‘𝑐)))))
36353imp 1129 . . . . . . 7 (((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ) → 2 ≤ (♯‘(2nd ‘𝑐)))
3736adantl 487 . . . . . 6 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → 2 ≤ (♯‘(2nd ‘𝑐)))
38 eqid 2766 . . . . . . 7 (iEdg‘𝐺) = (iEdg‘𝐺)
3913, 38clwlkclwwlk 30652 . . . . . 6 ((𝐺 ∈ USPGraph ∧ (2nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ 2 ≤ (♯‘(2nd ‘𝑐))) → (∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐) ↔ ((lastS‘(2nd ‘𝑐)) = ((2nd ‘𝑐)‘0) ∧ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) ∈ (ClWWalks‘𝐺))))
4012, 16, 37, 39syl3anc 1401 . . . . 5 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → (∃𝑓 𝑓(ClWalks‘𝐺)(2nd ‘𝑐) ↔ ((lastS‘(2nd ‘𝑐)) = ((2nd ‘𝑐)‘0) ∧ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) ∈ (ClWWalks‘𝐺))))
4111, 40mpbid 235 . . . 4 ((𝐺 ∈ USPGraph ∧ ((1st ‘𝑐)(Walks‘𝐺)(2nd ‘𝑐) ∧ ((2nd ‘𝑐)‘0) = ((2nd ‘𝑐)‘(♯‘(1st ‘𝑐))) ∧ (♯‘(1st ‘𝑐)) ∈ ℕ)) → ((lastS‘(2nd ‘𝑐)) = ((2nd ‘𝑐)‘0) ∧ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) ∈ (ClWWalks‘𝐺)))
424, 41sylan2 605 . . 3 ((𝐺 ∈ USPGraph ∧ 𝑐 ∈ 𝐶) → ((lastS‘(2nd ‘𝑐)) = ((2nd ‘𝑐)‘0) ∧ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) ∈ (ClWWalks‘𝐺)))
4342simprd 501 . 2 ((𝐺 ∈ USPGraph ∧ 𝑐 ∈ 𝐶) → ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) ∈ (ClWWalks‘𝐺))
44 clwlkclwwlkf.f . 2 𝐹 = (𝑐 ∈ 𝐶 ↦ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)))
4543, 44fmptd 7145 1 (𝐺 ∈ USPGraph → 𝐹:𝐶⟶(ClWWalks‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {crab 3415   class class class wbr 5107   ↦ cmpt 5191  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033  ℝcr 11237  0cc0 11238  1c1 11239   + caddc 11241   ≤ cle 11382   − cmin 11579  ℕcn 12374  2c2 12436  ℕ0cn0 12645  ♯chash 14514  Word cword 14698  lastSclsw 14747   prefix cpfx 14861  Vtxcvtx 29633  iEdgciedg 29634  USPGraphcuspgr 29788  Walkscwlks 30236  ClWalkscclwlks 30416  ClWWalkscclwwlk 30631
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1080  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-er 8754  df-map 8886  df-pm 8887  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-dju 10018  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-n0 12646  df-xnn0 12719  df-z 12733  df-uz 13005  df-fz 13679  df-fzo 13828  df-hash 14515  df-word 14699  df-lsw 14748  df-substr 14830  df-pfx 14862  df-edg 29685  df-uhgr 29695  df-upgr 29719  df-uspgr 29790  df-wlks 30239  df-clwlks 30417  df-clwwlk 30632
This theorem is used by:  clwlkclwwlkfo  30659  clwlkclwwlkf1  30660
  Copyright terms: Public domain W3C validator