ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iswlk GIF version

Theorem iswlk 16247
Description: Properties of a pair of functions to be/represent a walk. (Contributed by AV, 30-Dec-2020.)
Hypotheses
Ref Expression
wksfval.v 𝑉 = (Vtx‘𝐺)
wksfval.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
iswlk ((𝐺𝑊𝐹𝑈𝑃𝑍) → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
Distinct variable groups:   𝑘,𝐺   𝑘,𝐹   𝑃,𝑘
Allowed substitution hints:   𝑈(𝑘)   𝐼(𝑘)   𝑉(𝑘)   𝑊(𝑘)   𝑍(𝑘)

Proof of Theorem iswlk
Dummy variables 𝑓 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 4094 . . 3 (𝐹(Walks‘𝐺)𝑃 ↔ ⟨𝐹, 𝑃⟩ ∈ (Walks‘𝐺))
2 wksfval.v . . . . . 6 𝑉 = (Vtx‘𝐺)
3 wksfval.i . . . . . 6 𝐼 = (iEdg‘𝐺)
42, 3wksfval 16246 . . . . 5 (𝐺𝑊 → (Walks‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))})
543ad2ant1 1045 . . . 4 ((𝐺𝑊𝐹𝑈𝑃𝑍) → (Walks‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))})
65eleq2d 2301 . . 3 ((𝐺𝑊𝐹𝑈𝑃𝑍) → (⟨𝐹, 𝑃⟩ ∈ (Walks‘𝐺) ↔ ⟨𝐹, 𝑃⟩ ∈ {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))}))
71, 6bitrid 192 . 2 ((𝐺𝑊𝐹𝑈𝑃𝑍) → (𝐹(Walks‘𝐺)𝑃 ↔ ⟨𝐹, 𝑃⟩ ∈ {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))}))
8 eleq1 2294 . . . . . 6 (𝑓 = 𝐹 → (𝑓 ∈ Word dom 𝐼𝐹 ∈ Word dom 𝐼))
98adantr 276 . . . . 5 ((𝑓 = 𝐹𝑝 = 𝑃) → (𝑓 ∈ Word dom 𝐼𝐹 ∈ Word dom 𝐼))
10 simpr 110 . . . . . 6 ((𝑓 = 𝐹𝑝 = 𝑃) → 𝑝 = 𝑃)
11 fveq2 5648 . . . . . . . 8 (𝑓 = 𝐹 → (♯‘𝑓) = (♯‘𝐹))
1211oveq2d 6044 . . . . . . 7 (𝑓 = 𝐹 → (0...(♯‘𝑓)) = (0...(♯‘𝐹)))
1312adantr 276 . . . . . 6 ((𝑓 = 𝐹𝑝 = 𝑃) → (0...(♯‘𝑓)) = (0...(♯‘𝐹)))
1410, 13feq12d 5479 . . . . 5 ((𝑓 = 𝐹𝑝 = 𝑃) → (𝑝:(0...(♯‘𝑓))⟶𝑉𝑃:(0...(♯‘𝐹))⟶𝑉))
1511oveq2d 6044 . . . . . . 7 (𝑓 = 𝐹 → (0..^(♯‘𝑓)) = (0..^(♯‘𝐹)))
1615adantr 276 . . . . . 6 ((𝑓 = 𝐹𝑝 = 𝑃) → (0..^(♯‘𝑓)) = (0..^(♯‘𝐹)))
17 fveq1 5647 . . . . . . . . 9 (𝑝 = 𝑃 → (𝑝𝑘) = (𝑃𝑘))
18 fveq1 5647 . . . . . . . . 9 (𝑝 = 𝑃 → (𝑝‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)))
1917, 18eqeq12d 2246 . . . . . . . 8 (𝑝 = 𝑃 → ((𝑝𝑘) = (𝑝‘(𝑘 + 1)) ↔ (𝑃𝑘) = (𝑃‘(𝑘 + 1))))
2019adantl 277 . . . . . . 7 ((𝑓 = 𝐹𝑝 = 𝑃) → ((𝑝𝑘) = (𝑝‘(𝑘 + 1)) ↔ (𝑃𝑘) = (𝑃‘(𝑘 + 1))))
21 fveq1 5647 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑘) = (𝐹𝑘))
2221fveq2d 5652 . . . . . . . 8 (𝑓 = 𝐹 → (𝐼‘(𝑓𝑘)) = (𝐼‘(𝐹𝑘)))
2317sneqd 3686 . . . . . . . 8 (𝑝 = 𝑃 → {(𝑝𝑘)} = {(𝑃𝑘)})
2422, 23eqeqan12d 2247 . . . . . . 7 ((𝑓 = 𝐹𝑝 = 𝑃) → ((𝐼‘(𝑓𝑘)) = {(𝑝𝑘)} ↔ (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}))
2517, 18preq12d 3760 . . . . . . . . 9 (𝑝 = 𝑃 → {(𝑝𝑘), (𝑝‘(𝑘 + 1))} = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
2625adantl 277 . . . . . . . 8 ((𝑓 = 𝐹𝑝 = 𝑃) → {(𝑝𝑘), (𝑝‘(𝑘 + 1))} = {(𝑃𝑘), (𝑃‘(𝑘 + 1))})
2722adantr 276 . . . . . . . 8 ((𝑓 = 𝐹𝑝 = 𝑃) → (𝐼‘(𝑓𝑘)) = (𝐼‘(𝐹𝑘)))
2826, 27sseq12d 3259 . . . . . . 7 ((𝑓 = 𝐹𝑝 = 𝑃) → ({(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘)) ↔ {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))
2920, 24, 28ifpbi123d 1001 . . . . . 6 ((𝑓 = 𝐹𝑝 = 𝑃) → (if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))) ↔ if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))))
3016, 29raleqbidv 2747 . . . . 5 ((𝑓 = 𝐹𝑝 = 𝑃) → (∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))) ↔ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘)))))
319, 14, 303anbi123d 1349 . . . 4 ((𝑓 = 𝐹𝑝 = 𝑃) → ((𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘)))) ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
3231opelopabga 4363 . . 3 ((𝐹𝑈𝑃𝑍) → (⟨𝐹, 𝑃⟩ ∈ {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))} ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
33323adant1 1042 . 2 ((𝐺𝑊𝐹𝑈𝑃𝑍) → (⟨𝐹, 𝑃⟩ ∈ {⟨𝑓, 𝑝⟩ ∣ (𝑓 ∈ Word dom 𝐼𝑝:(0...(♯‘𝑓))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝑓))if-((𝑝𝑘) = (𝑝‘(𝑘 + 1)), (𝐼‘(𝑓𝑘)) = {(𝑝𝑘)}, {(𝑝𝑘), (𝑝‘(𝑘 + 1))} ⊆ (𝐼‘(𝑓𝑘))))} ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
347, 33bitrd 188 1 ((𝐺𝑊𝐹𝑈𝑃𝑍) → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹𝑘)) = {(𝑃𝑘)}, {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹𝑘))))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  if-wif 986  w3a 1005   = wceq 1398  wcel 2202  wral 2511  wss 3201  {csn 3673  {cpr 3674  cop 3676   class class class wbr 4093  {copab 4154  dom cdm 4731  wf 5329  cfv 5333  (class class class)co 6028  0cc0 8075  1c1 8076   + caddc 8078  ...cfz 10288  ..^cfzo 10422  chash 11083  Word cword 11162  Vtxcvtx 15936  iEdgciedg 15937  Walkscwlks 16241
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-dc 843  df-ifp 987  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-1o 6625  df-er 6745  df-map 6862  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-9 9251  df-n0 9445  df-z 9524  df-dec 9656  df-uz 9800  df-fz 10289  df-fzo 10423  df-ihash 11084  df-word 11163  df-ndx 13148  df-slot 13149  df-base 13151  df-edgf 15929  df-vtx 15938  df-iedg 15939  df-wlks 16242
This theorem is referenced by:  wlkpropg  16248  iswlkg  16253  wlkvtxeledgg  16268
  Copyright terms: Public domain W3C validator