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

Theorem wwlksnredwwlkn0 30542
Description: For each walk (as word) of length at least 1 there is a shorter walk (as word) starting at the same vertex. (Contributed by Alexander van der Vekens, 22-Aug-2018.) (Revised by AV, 18-Apr-2021.) (Revised by AV, 26-Oct-2022.)
Hypothesis
Ref Expression
wwlksnredwwlkn.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
wwlksnredwwlkn0 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ((𝑊‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
Distinct variable groups:   𝑦,𝐸   𝑦,𝐺   𝑦,𝑁   𝑦,𝑊   𝑦,𝑃

Proof of Theorem wwlksnredwwlkn0
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 wwlksnredwwlkn.e . . . . 5 𝐸 = (Edg‘𝐺)
21wwlksnredwwlkn 30541 . . . 4 (𝑁 ∈ ℕ0 → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
32imp 412 . . 3 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸))
4 simpl 488 . . . . . . . . 9 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → (𝑊 prefix (𝑁 + 1)) = 𝑦)
54adantl 487 . . . . . . . 8 (((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) ∧ ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)) → (𝑊 prefix (𝑁 + 1)) = 𝑦)
6 fveq1 6915 . . . . . . . . . . . . . 14 (𝑦 = (𝑊 prefix (𝑁 + 1)) → (𝑦‘0) = ((𝑊 prefix (𝑁 + 1))‘0))
76eqcoms 2771 . . . . . . . . . . . . 13 ((𝑊 prefix (𝑁 + 1)) = 𝑦 → (𝑦‘0) = ((𝑊 prefix (𝑁 + 1))‘0))
87adantr 486 . . . . . . . . . . . 12 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺))) → (𝑦‘0) = ((𝑊 prefix (𝑁 + 1))‘0))
9 eqid 2763 . . . . . . . . . . . . . . . . . . 19 (Vtx‘𝐺) = (Vtx‘𝐺)
109, 1wwlknp 30489 . . . . . . . . . . . . . . . . . 18 (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
11 nn0p1nn 12685 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
12 peano2nn0 12686 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
13 nn0re 12655 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 + 1) ∈ ℕ0 → (𝑁 + 1) ∈ ℝ)
14 lep1 12198 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 + 1) ∈ ℝ → (𝑁 + 1) ≤ ((𝑁 + 1) + 1))
1512, 13, 143syl 19 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑁 ∈ ℕ0 → (𝑁 + 1) ≤ ((𝑁 + 1) + 1))
16 peano2nn0 12686 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((𝑁 + 1) ∈ ℕ0 → ((𝑁 + 1) + 1) ∈ ℕ0)
1716nn0zd 12758 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 + 1) ∈ ℕ0 → ((𝑁 + 1) + 1) ∈ ℤ)
18 fznn 13766 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝑁 + 1) + 1) ∈ ℤ → ((𝑁 + 1) ∈ (1...((𝑁 + 1) + 1)) ↔ ((𝑁 + 1) ∈ ℕ ∧ (𝑁 + 1) ≤ ((𝑁 + 1) + 1))))
1912, 17, 183syl 19 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑁 ∈ ℕ0 → ((𝑁 + 1) ∈ (1...((𝑁 + 1) + 1)) ↔ ((𝑁 + 1) ∈ ℕ ∧ (𝑁 + 1) ≤ ((𝑁 + 1) + 1))))
2011, 15, 19mpbir2and 726 . . . . . . . . . . . . . . . . . . . . . 22 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (1...((𝑁 + 1) + 1)))
21 oveq2 7459 . . . . . . . . . . . . . . . . . . . . . . 23 ((♯‘𝑊) = ((𝑁 + 1) + 1) → (1...(♯‘𝑊)) = (1...((𝑁 + 1) + 1)))
2221eleq2d 2850 . . . . . . . . . . . . . . . . . . . . . 22 ((♯‘𝑊) = ((𝑁 + 1) + 1) → ((𝑁 + 1) ∈ (1...(♯‘𝑊)) ↔ (𝑁 + 1) ∈ (1...((𝑁 + 1) + 1))))
2320, 22imbitrrid 249 . . . . . . . . . . . . . . . . . . . . 21 ((♯‘𝑊) = ((𝑁 + 1) + 1) → (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (1...(♯‘𝑊))))
2423adantl 487 . . . . . . . . . . . . . . . . . . . 20 ((𝑊 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (1...(♯‘𝑊))))
25 simpl 488 . . . . . . . . . . . . . . . . . . . 20 ((𝑊 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → 𝑊 ∈ Word (Vtx‘𝐺))
2624, 25jctild 535 . . . . . . . . . . . . . . . . . . 19 ((𝑊 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → (𝑁 ∈ ℕ0 → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊)))))
27263adant3 1150 . . . . . . . . . . . . . . . . . 18 ((𝑊 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑁 ∈ ℕ0 → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊)))))
2810, 27syl 18 . . . . . . . . . . . . . . . . 17 (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑁 ∈ ℕ0 → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊)))))
2928impcom 413 . . . . . . . . . . . . . . . 16 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊))))
3029adantl 487 . . . . . . . . . . . . . . 15 (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊))))
3130adantr 486 . . . . . . . . . . . . . 14 ((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊))))
3231adantl 487 . . . . . . . . . . . . 13 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺))) → (𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊))))
33 pfxfv0 14883 . . . . . . . . . . . . 13 ((𝑊 ∈ Word (Vtx‘𝐺) ∧ (𝑁 + 1) ∈ (1...(♯‘𝑊))) → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑊‘0))
3432, 33syl 18 . . . . . . . . . . . 12 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺))) → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑊‘0))
35 simprll 791 . . . . . . . . . . . 12 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺))) → (𝑊‘0) = 𝑃)
368, 34, 353eqtrd 2802 . . . . . . . . . . 11 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺))) → (𝑦‘0) = 𝑃)
3736ex 418 . . . . . . . . . 10 ((𝑊 prefix (𝑁 + 1)) = 𝑦 → ((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) → (𝑦‘0) = 𝑃))
3837adantr 486 . . . . . . . . 9 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) → (𝑦‘0) = 𝑃))
3938impcom 413 . . . . . . . 8 (((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) ∧ ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)) → (𝑦‘0) = 𝑃)
40 simpr 490 . . . . . . . . 9 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)
4140adantl 487 . . . . . . . 8 (((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) ∧ ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)) → {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)
425, 39, 413jca 1146 . . . . . . 7 (((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) ∧ ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)) → ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸))
4342ex 418 . . . . . 6 ((((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) ∧ 𝑦 ∈ (𝑁 WWalksN 𝐺)) → (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
4443reximdva 3179 . . . . 5 (((𝑊‘0) = 𝑃 ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → (∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
4544ex 418 . . . 4 ((𝑊‘0) = 𝑃 → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸))))
4645com13 89 . . 3 (∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ((𝑊‘0) = 𝑃 → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸))))
473, 46mpcom 39 . 2 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ((𝑊‘0) = 𝑃 → ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
4829, 33syl 18 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑊‘0))
4948eqcomd 2769 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (𝑊‘0) = ((𝑊 prefix (𝑁 + 1))‘0))
5049adantl 487 . . . . . . 7 ((((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → (𝑊‘0) = ((𝑊 prefix (𝑁 + 1))‘0))
51 fveq1 6915 . . . . . . . . 9 ((𝑊 prefix (𝑁 + 1)) = 𝑦 → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑦‘0))
5251adantr 486 . . . . . . . 8 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑦‘0))
5352adantr 486 . . . . . . 7 ((((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → ((𝑊 prefix (𝑁 + 1))‘0) = (𝑦‘0))
54 simpr 490 . . . . . . . 8 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) → (𝑦‘0) = 𝑃)
5554adantr 486 . . . . . . 7 ((((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → (𝑦‘0) = 𝑃)
5650, 53, 553eqtrd 2802 . . . . . 6 ((((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) ∧ (𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))) → (𝑊‘0) = 𝑃)
5756ex 418 . . . . 5 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (𝑊‘0) = 𝑃))
58573adant3 1150 . . . 4 (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (𝑊‘0) = 𝑃))
5958com12 33 . . 3 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → (𝑊‘0) = 𝑃))
6059rexlimdvw 3172 . 2 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → (∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸) → (𝑊‘0) = 𝑃))
6147, 60impbid 215 1 ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)) → ((𝑊‘0) = 𝑃 ↔ ∃𝑦 ∈ (𝑁 WWalksN 𝐺)((𝑊 prefix (𝑁 + 1)) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑊)} ∈ 𝐸)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {cpr 4590   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  0cc0 11239  1c1 11240   + caddc 11242   ≤ cle 11383  ℕcn 12375  ℕ0cn0 12646  ℤcz 12733  ...cfz 13679  ..^cfzo 13828  ♯chash 14515  Word cword 14699  lastSclsw 14748   prefix cpfx 14862  Vtxcvtx 29631  Edgcedg 29682   WWalksN cwwlksn 30472
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-lsw 14749  df-substr 14831  df-pfx 14863  df-wwlks 30476  df-wwlksn 30477
This theorem is used by:  rusgrnumwwlks  30623
  Copyright terms: Public domain W3C validator