ewlkprop - Metamath Proof Explorer

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

Theorem ewlkprop 29679

Description: Properties of an s-walk of edges. (Contributed by AV, 4-Jan-2021.)

**Hypothesis**
Ref	Expression
ewlksfval.i	⊢ 𝐼 = (iEdg‘𝐺)

**Assertion**
Ref	Expression
ewlkprop	⊢ (𝐹 ∈ (𝐺 EdgWalks 𝑆) → ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) ∧ 𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))))

Distinct variable groups: 𝑘,𝐺 𝑆,𝑘 𝑘,𝐹 Allowed substitution hint: 𝐼(𝑘)

Proof of Theorem ewlkprop Dummy variables 𝑓 𝑔 𝑖 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ewlks 29674	. . 3 ⊢ EdgWalks = (𝑔 ∈ V, 𝑠 ∈ ℕ₀^* ↦ {𝑓 ∣ [(iEdg‘𝑔) / 𝑖](𝑓 ∈ Word dom 𝑖 ∧ ∀𝑘 ∈ (1..^(♯‘𝑓))𝑠 ≤ (♯‘((𝑖‘(𝑓‘(𝑘 − 1))) ∩ (𝑖‘(𝑓‘𝑘)))))})
2	1	elmpocl 7599	. 2 ⊢ (𝐹 ∈ (𝐺 EdgWalks 𝑆) → (𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*))
3		simpr 484	. . 3 ⊢ ((𝐹 ∈ (𝐺 EdgWalks 𝑆) ∧ (𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^)) → (𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^))
4		ewlksfval.i	. . . . . . . . 9 ⊢ 𝐼 = (iEdg‘𝐺)
5	4	isewlk 29678	. . . . . . . 8 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^* ∧ 𝐹 ∈ (𝐺 EdgWalks 𝑆)) → (𝐹 ∈ (𝐺 EdgWalks 𝑆) ↔ (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘)))))))
6	5	3expa 1118	. . . . . . 7 ⊢ (((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) ∧ 𝐹 ∈ (𝐺 EdgWalks 𝑆)) → (𝐹 ∈ (𝐺 EdgWalks 𝑆) ↔ (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘)))))))
7	6	biimpd 229	. . . . . 6 ⊢ (((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) ∧ 𝐹 ∈ (𝐺 EdgWalks 𝑆)) → (𝐹 ∈ (𝐺 EdgWalks 𝑆) → (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘)))))))
8	7	expcom 413	. . . . 5 ⊢ (𝐹 ∈ (𝐺 EdgWalks 𝑆) → ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) → (𝐹 ∈ (𝐺 EdgWalks 𝑆) → (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))))))
9	8	pm2.43a 54	. . . 4 ⊢ (𝐹 ∈ (𝐺 EdgWalks 𝑆) → ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) → (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘)))))))
10	9	imp 406	. . 3 ⊢ ((𝐹 ∈ (𝐺 EdgWalks 𝑆) ∧ (𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*)) → (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))))
11		3anass 1094	. . 3 ⊢ (((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^) ∧ 𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))) ↔ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^) ∧ (𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘)))))))
12	3, 10, 11	sylanbrc 583	. 2 ⊢ ((𝐹 ∈ (𝐺 EdgWalks 𝑆) ∧ (𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^)) → ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^) ∧ 𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))))
13	2, 12	mpdan 687	1 ⊢ (𝐹 ∈ (𝐺 EdgWalks 𝑆) → ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ₀^*) ∧ 𝐹 ∈ Word dom 𝐼 ∧ ∀𝑘 ∈ (1..^(♯‘𝐹))𝑆 ≤ (♯‘((𝐼‘(𝐹‘(𝑘 − 1))) ∩ (𝐼‘(𝐹‘𝑘))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 {cab 2714 ∀wral 3051 Vcvv 3440 [wsbc 3740 ∩ cin 3900 class class class wbr 5098 dom cdm 5624 ‘cfv 6492 (class class class)co 7358 1c1 11029 ≤ cle 11169 − cmin 11366 ℕ₀^*cxnn0 12476 ..^cfzo 13572 ♯chash 14255 Word cword 14438 iEdgciedg 29072 EdgWalks cewlks 29671

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-n0 12404 df-z 12491 df-uz 12754 df-fz 13426 df-fzo 13573 df-hash 14256 df-word 14439 df-ewlks 29674

This theorem is referenced by: ewlkinedg 29680 ewlkle 29681 upgrewlkle2 29682

W3C validator