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

Theorem ewlksfval 30239
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 30236 . . . 4 EdgWalks = (𝑔 ∈ V, 𝑠 ∈ ℕ0* ↦ {𝑓 ∣ [(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))))})
21a1i 11 . . 3 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → EdgWalks = (𝑔 ∈ V, 𝑠 ∈ ℕ0* ↦ {𝑓 ∣ [(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))))}))
3 fvexd 6931 . . . . . 6 ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (iEdg‘𝑔) ∈ V)
4 simpr 490 . . . . . . . . . . 11 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑖 = (iEdg‘𝑔))
5 fveq2 6916 . . . . . . . . . . . . 13 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
65adantr 486 . . . . . . . . . . . 12 ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → (iEdg‘𝑔) = (iEdg‘𝐺))
76adantr 486 . . . . . . . . . . 11 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (iEdg‘𝑔) = (iEdg‘𝐺))
84, 7eqtrd 2798 . . . . . . . . . 10 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑖 = (iEdg‘𝐺))
98dmeqd 5899 . . . . . . . . 9 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → dom 𝑖 = dom (iEdg‘𝐺))
10 wrdeq 14722 . . . . . . . . 9 (dom 𝑖 = dom (iEdg‘𝐺) → Word dom 𝑖 = Word dom (iEdg‘𝐺))
119, 10syl 18 . . . . . . . 8 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → Word dom 𝑖 = Word dom (iEdg‘𝐺))
1211eleq2d 2850 . . . . . . 7 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑓 ∈ Word dom 𝑖 ↔ 𝑓 ∈ Word dom (iEdg‘𝐺)))
13 simpr 490 . . . . . . . . . 10 ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
1413adantr 486 . . . . . . . . 9 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → 𝑠 = 𝑆)
158fveq1d 6918 . . . . . . . . . . 11 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑖‘(𝑓‘(𝑘 − 1))) = ((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))))
168fveq1d 6918 . . . . . . . . . . 11 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑖‘(𝑓‘𝑘)) = ((iEdg‘𝐺)‘(𝑓‘𝑘)))
1715, 16ineq12d 4121 . . . . . . . . . 10 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → ((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘))) = (((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))
1817fveq2d 6920 . . . . . . . . 9 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))) = (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))
1914, 18breq12d 5121 . . . . . . . 8 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))) ↔ 𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))))
2019ralbidv 3189 . . . . . . 7 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → (∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))) ↔ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))))
2112, 20anbi12d 644 . . . . . 6 (((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) ∧ 𝑖 = (iEdg‘𝑔)) → ((𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘))))) ↔ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))))
223, 21sbcied 3785 . . . . 5 ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → ([(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘))))) ↔ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))))
2322abbidv 2829 . . . 4 ((𝑔 = 𝐺 ∧ 𝑠 = 𝑆) → {𝑓 ∣ [(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))})
2423adantl 487 . . 3 (((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) ∧ (𝑔 = 𝐺 ∧ 𝑠 = 𝑆)) → {𝑓 ∣ [(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))})
25 elex 3475 . . . 4 (𝐺 ∈ 𝑊 → 𝐺 ∈ V)
2625adantr 486 . . 3 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → 𝐺 ∈ V)
27 simpr 490 . . 3 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → 𝑆 ∈ ℕ0*)
28 df-rab 3417 . . . 4 {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))} = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))}
29 fvex 6929 . . . . . . . 8 (iEdg‘𝐺) ∈ V
3029dmex 7955 . . . . . . 7 dom (iEdg‘𝐺) ∈ V
3130wrdexi 14712 . . . . . 6 Word dom (iEdg‘𝐺) ∈ V
3231rabex 5307 . . . . 5 {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))} ∈ V
3332a1i 11 . . . 4 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → {𝑓 ∈ Word dom (iEdg‘𝐺) ∣ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))} ∈ V)
3428, 33eqeltrrid 2869 . . 3 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))} ∈ V)
352, 24, 26, 27, 34ovmpod 7604 . 2 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (𝐺 EdgWalks 𝑆) = {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))})
36 ewlksfval.i . . . . . . . . 9 𝐼 = (iEdg‘𝐺)
3736eqcomi 2772 . . . . . . . 8 (iEdg‘𝐺) = 𝐼
3837a1i 11 . . . . . . 7 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (iEdg‘𝐺) = 𝐼)
3938dmeqd 5899 . . . . . 6 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → dom (iEdg‘𝐺) = dom 𝐼)
40 wrdeq 14722 . . . . . 6 (dom (iEdg‘𝐺) = dom 𝐼 → Word dom (iEdg‘𝐺) = Word dom 𝐼)
4139, 40syl 18 . . . . 5 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → Word dom (iEdg‘𝐺) = Word dom 𝐼)
4241eleq2d 2850 . . . 4 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (𝑓 ∈ Word dom (iEdg‘𝐺) ↔ 𝑓 ∈ Word dom 𝐼))
4338fveq1d 6918 . . . . . . . 8 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → ((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) = (𝐼‘(𝑓‘(𝑘 − 1))))
4438fveq1d 6918 . . . . . . . 8 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → ((iEdg‘𝐺)‘(𝑓‘𝑘)) = (𝐼‘(𝑓‘𝑘)))
4543, 44ineq12d 4121 . . . . . . 7 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))) = ((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘))))
4645fveq2d 6920 . . . . . 6 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))) = (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘)))))
4746breq2d 5120 . . . . 5 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))) ↔ 𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘))))))
4847ralbidv 3189 . . . 4 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))) ↔ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘))))))
4942, 48anbi12d 644 . . 3 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → ((𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘))))) ↔ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘)))))))
5049abbidv 2829 . 2 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → {𝑓 ∣ (𝑓 ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(𝑓‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(𝑓‘𝑘)))))} = {𝑓 ∣ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘)))))})
5135, 50eqtrd 2798 1 ((𝐺 ∈ 𝑊 ∧ 𝑆 ∈ ℕ0*) → (𝐺 EdgWalks 𝑆) = {𝑓 ∣ (𝑓 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑆 ≤ (♯‘((𝐼‘(𝑓‘(𝑘 − 1))) ∩ (𝐼‘(𝑓‘𝑘)))))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  {crab 3416  Vcvv 3454  [wsbc 3742   ∩ cin 4092   class class class wbr 5108  dom cdm 5658  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1c1 11240   ≤ cle 11383   − cmin 11580  ℕ0*cxnn0 12719  ..^cfzo 13828  ♯chash 14515  Word cword 14699  iEdgciedg 29632   EdgWalks cewlks 30233
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-fzo 13829  df-hash 14516  df-word 14700  df-ewlks 30236
This theorem is used by:  isewlk  30240
  Copyright terms: Public domain W3C validator