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

Theorem ewlksfval 29620
Description: The set of s-walks of edges (in a hypergraph). (Contributed by AV, 4-Jan-2021.)
Hypothesis
Ref Expression
ewlksfval.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
ewlksfval ((𝐺𝑊𝑆 ∈ ℕ0*) → (𝐺 EdgWalks 𝑆) = {𝑓 ∣ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘)))))})
Distinct variable groups:   𝑓,𝐺,𝑘   𝑆,𝑓,𝑘   𝑓,𝑊,𝑘
Allowed substitution hints:   𝐼(𝑓,𝑘)

Proof of Theorem ewlksfval
Dummy variables 𝑔 𝑖 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ewlks 29617 . . . 4 EdgWalks = (𝑔 ∈ V, 𝑠 ∈ ℕ0* ↦ {𝑓[(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))))})
21a1i 11 . . 3 ((𝐺𝑊𝑆 ∈ ℕ0*) → EdgWalks = (𝑔 ∈ V, 𝑠 ∈ ℕ0* ↦ {𝑓[(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))))}))
3 fvexd 6920 . . . . . 6 ((𝑔 = 𝐺𝑠 = 𝑆) → (iEdg‘𝑔) ∈ V)
4 simpr 484 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑖 = (iEdg‘𝑔))
5 fveq2 6905 . . . . . . . . . . . . 13 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
65adantr 480 . . . . . . . . . . . 12 ((𝑔 = 𝐺𝑠 = 𝑆) → (iEdg‘𝑔) = (iEdg‘𝐺))
76adantr 480 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (iEdg‘𝑔) = (iEdg‘𝐺))
84, 7eqtrd 2776 . . . . . . . . . 10 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑖 = (iEdg‘𝐺))
98dmeqd 5915 . . . . . . . . 9 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → dom 𝑖 = dom (iEdg‘𝐺))
10 wrdeq 14575 . . . . . . . . 9 (dom 𝑖 = dom (iEdg‘𝐺) → Word dom 𝑖 = Word dom (iEdg‘𝐺))
119, 10syl 17 . . . . . . . 8 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → Word dom 𝑖 = Word dom (iEdg‘𝐺))
1211eleq2d 2826 . . . . . . 7 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑓 ∈ Word dom 𝑖𝑓 ∈ Word dom (iEdg‘𝐺)))
13 simpr 484 . . . . . . . . . 10 ((𝑔 = 𝐺𝑠 = 𝑆) → 𝑠 = 𝑆)
1413adantr 480 . . . . . . . . 9 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑠 = 𝑆)
158fveq1d 6907 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑖‘(𝑓‘(𝑘 − 1))) = ((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))))
168fveq1d 6907 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑖‘(𝑓𝑘)) = ((iEdg‘𝐺)‘(𝑓𝑘)))
1715, 16ineq12d 4220 . . . . . . . . . 10 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → ((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘))) = (((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))
1817fveq2d 6909 . . . . . . . . 9 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))) = (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))
1914, 18breq12d 5155 . . . . . . . 8 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))) ↔ 𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))))
2019ralbidv 3177 . . . . . . 7 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))) ↔ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))))
2112, 20anbi12d 632 . . . . . 6 (((𝑔 = 𝐺𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → ((𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘))))) ↔ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))))
223, 21sbcied 3831 . . . . 5 ((𝑔 = 𝐺𝑠 = 𝑆) → ([(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘))))) ↔ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))))
2322abbidv 2807 . . . 4 ((𝑔 = 𝐺𝑠 = 𝑆) → {𝑓[(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))})
2423adantl 481 . . 3 (((𝐺𝑊𝑆 ∈ ℕ0*) ∧ (𝑔 = 𝐺𝑠 = 𝑆)) → {𝑓[(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))})
25 elex 3500 . . . 4 (𝐺𝑊𝐺 ∈ V)
2625adantr 480 . . 3 ((𝐺𝑊𝑆 ∈ ℕ0*) → 𝐺 ∈ V)
27 simpr 484 . . 3 ((𝐺𝑊𝑆 ∈ ℕ0*) → 𝑆 ∈ ℕ0*)
28 df-rab 3436 . . . 4 {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))}
29 fvex 6918 . . . . . . . 8 (iEdg‘𝐺) ∈ V
3029dmex 7932 . . . . . . 7 dom (iEdg‘𝐺) ∈ V
3130wrdexi 14565 . . . . . 6 Word dom (iEdg‘𝐺) ∈ V
3231rabex 5338 . . . . 5 {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))} ∈ V
3332a1i 11 . . . 4 ((𝐺𝑊𝑆 ∈ ℕ0*) → {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))} ∈ V)
3428, 33eqeltrrid 2845 . . 3 ((𝐺𝑊𝑆 ∈ ℕ0*) → {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))} ∈ V)
352, 24, 26, 27, 34ovmpod 7586 . 2 ((𝐺𝑊𝑆 ∈ ℕ0*) → (𝐺 EdgWalks 𝑆) = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))})
36 ewlksfval.i . . . . . . . . 9 𝐼 = (iEdg‘𝐺)
3736eqcomi 2745 . . . . . . . 8 (iEdg‘𝐺) = 𝐼
3837a1i 11 . . . . . . 7 ((𝐺𝑊𝑆 ∈ ℕ0*) → (iEdg‘𝐺) = 𝐼)
3938dmeqd 5915 . . . . . 6 ((𝐺𝑊𝑆 ∈ ℕ0*) → dom (iEdg‘𝐺) = dom 𝐼)
40 wrdeq 14575 . . . . . 6 (dom (iEdg‘𝐺) = dom 𝐼 → Word dom (iEdg‘𝐺) = Word dom 𝐼)
4139, 40syl 17 . . . . 5 ((𝐺𝑊𝑆 ∈ ℕ0*) → Word dom (iEdg‘𝐺) = Word dom 𝐼)
4241eleq2d 2826 . . . 4 ((𝐺𝑊𝑆 ∈ ℕ0*) → (𝑓 ∈ Word dom (iEdg‘𝐺) ↔ 𝑓 ∈ Word dom 𝐼))
4338fveq1d 6907 . . . . . . . 8 ((𝐺𝑊𝑆 ∈ ℕ0*) → ((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) = (𝐼‘(𝑓‘(𝑘 − 1))))
4438fveq1d 6907 . . . . . . . 8 ((𝐺𝑊𝑆 ∈ ℕ0*) → ((iEdg‘𝐺)‘(𝑓𝑘)) = (𝐼‘(𝑓𝑘)))
4543, 44ineq12d 4220 . . . . . . 7 ((𝐺𝑊𝑆 ∈ ℕ0*) → (((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))) = ((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘))))
4645fveq2d 6909 . . . . . 6 ((𝐺𝑊𝑆 ∈ ℕ0*) → (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))) = (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘)))))
4746breq2d 5154 . . . . 5 ((𝐺𝑊𝑆 ∈ ℕ0*) → (𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))) ↔ 𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘))))))
4847ralbidv 3177 . . . 4 ((𝐺𝑊𝑆 ∈ ℕ0*) → (∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))) ↔ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘))))))
4942, 48anbi12d 632 . . 3 ((𝐺𝑊𝑆 ∈ ℕ0*) → ((𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘))))) ↔ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘)))))))
5049abbidv 2807 . 2 ((𝐺𝑊𝑆 ∈ ℕ0*) → {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘)))))})
5135, 50eqtrd 2776 1 ((𝐺𝑊𝑆 ∈ ℕ0*) → (𝐺 EdgWalks 𝑆) = {𝑓 ∣ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓𝑘)))))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  {cab 2713  wral 3060  {crab 3435  Vcvv 3479  [wsbc 3787  cin 3949   class class class wbr 5142  dom cdm 5684  cfv 6560  (class class class)co 7432  cmpo 7434  1c1 11157  cle 11297  cmin 11493  0*cxnn0 12601  ..^cfzo 13695  chash 14370  Word cword 14553  iEdgciedg 29015   EdgWalks cewlks 29614
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-1o 8507  df-er 8746  df-map 8869  df-en 8987  df-dom 8988  df-sdom 8989  df-fin 8990  df-card 9980  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-nn 12268  df-n0 12529  df-z 12616  df-uz 12880  df-fz 13549  df-fzo 13696  df-hash 14371  df-word 14554  df-ewlks 29617
This theorem is referenced by:  isewlk  29621
  Copyright terms: Public domain W3C validator