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

Theorem clwlkclwwlkf1lem3 27153
Description: Lemma 3 for clwlkclwwlkf1 27157. (Contributed by Alexander van der Vekens, 5-Jul-2018.) (Revised by AV, 3-May-2021.) (Revised by AV, 24-May-2022.)
Hypotheses
Ref Expression
clwlkclwwlkf.c 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st𝑤))}
clwlkclwwlkf.a 𝐴 = (1st𝑈)
clwlkclwwlkf.b 𝐵 = (2nd𝑈)
clwlkclwwlkf.d 𝐷 = (1st𝑊)
clwlkclwwlkf.e 𝐸 = (2nd𝑊)
Assertion
Ref Expression
clwlkclwwlkf1lem3 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → ∀𝑖 ∈ (0...(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))
Distinct variable groups:   𝑖,𝐺   𝑤,𝐺   𝑤,𝐴   𝑤,𝑈   𝐴,𝑖   𝐵,𝑖   𝐷,𝑖   𝑤,𝐷   𝑖,𝐸   𝑤,𝑊
Allowed substitution hints:   𝐵(𝑤)   𝐶(𝑤,𝑖)   𝑈(𝑖)   𝐸(𝑤)   𝑊(𝑖)

Proof of Theorem clwlkclwwlkf1lem3
StepHypRef Expression
1 clwlkclwwlkf.c . . . . 5 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st𝑤))}
2 clwlkclwwlkf.a . . . . 5 𝐴 = (1st𝑈)
3 clwlkclwwlkf.b . . . . 5 𝐵 = (2nd𝑈)
4 clwlkclwwlkf.d . . . . 5 𝐷 = (1st𝑊)
5 clwlkclwwlkf.e . . . . 5 𝐸 = (2nd𝑊)
61, 2, 3, 4, 5clwlkclwwlkf1lem2 27152 . . . 4 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → ((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖)))
7 simprr 748 . . . . 5 (((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) ∧ ((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))) → ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))
81, 2, 3clwlkclwwlkflem 27151 . . . . . . . . 9 (𝑈𝐶 → (𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ))
91, 4, 5clwlkclwwlkflem 27151 . . . . . . . . 9 (𝑊𝐶 → (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ))
10 lbfzo0 12715 . . . . . . . . . . . . . . . 16 (0 ∈ (0..^(♯‘𝐴)) ↔ (♯‘𝐴) ∈ ℕ)
1110biimpri 218 . . . . . . . . . . . . . . 15 ((♯‘𝐴) ∈ ℕ → 0 ∈ (0..^(♯‘𝐴)))
12113ad2ant3 1128 . . . . . . . . . . . . . 14 ((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) → 0 ∈ (0..^(♯‘𝐴)))
1312adantr 466 . . . . . . . . . . . . 13 (((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) → 0 ∈ (0..^(♯‘𝐴)))
1413adantr 466 . . . . . . . . . . . 12 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → 0 ∈ (0..^(♯‘𝐴)))
15 fveq2 6332 . . . . . . . . . . . . . 14 (𝑖 = 0 → (𝐵𝑖) = (𝐵‘0))
16 fveq2 6332 . . . . . . . . . . . . . 14 (𝑖 = 0 → (𝐸𝑖) = (𝐸‘0))
1715, 16eqeq12d 2785 . . . . . . . . . . . . 13 (𝑖 = 0 → ((𝐵𝑖) = (𝐸𝑖) ↔ (𝐵‘0) = (𝐸‘0)))
1817rspcv 3454 . . . . . . . . . . . 12 (0 ∈ (0..^(♯‘𝐴)) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) → (𝐵‘0) = (𝐸‘0)))
1914, 18syl 17 . . . . . . . . . . 11 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) → (𝐵‘0) = (𝐸‘0)))
20 simpl 468 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝐵‘(♯‘𝐴)) = (𝐵‘0) ∧ ((𝐵‘0) = (𝐸‘0) ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)))) → (𝐵‘(♯‘𝐴)) = (𝐵‘0))
21 eqtr 2789 . . . . . . . . . . . . . . . . . . . . . . . 24 (((𝐵‘0) = (𝐸‘0) ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷))) → (𝐵‘0) = (𝐸‘(♯‘𝐷)))
2221adantl 467 . . . . . . . . . . . . . . . . . . . . . . 23 (((𝐵‘(♯‘𝐴)) = (𝐵‘0) ∧ ((𝐵‘0) = (𝐸‘0) ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)))) → (𝐵‘0) = (𝐸‘(♯‘𝐷)))
2320, 22eqtrd 2804 . . . . . . . . . . . . . . . . . . . . . 22 (((𝐵‘(♯‘𝐴)) = (𝐵‘0) ∧ ((𝐵‘0) = (𝐸‘0) ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)))) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))
2423exp32 407 . . . . . . . . . . . . . . . . . . . . 21 ((𝐵‘(♯‘𝐴)) = (𝐵‘0) → ((𝐵‘0) = (𝐸‘0) → ((𝐸‘0) = (𝐸‘(♯‘𝐷)) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
2524com23 86 . . . . . . . . . . . . . . . . . . . 20 ((𝐵‘(♯‘𝐴)) = (𝐵‘0) → ((𝐸‘0) = (𝐸‘(♯‘𝐷)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
2625eqcoms 2778 . . . . . . . . . . . . . . . . . . 19 ((𝐵‘0) = (𝐵‘(♯‘𝐴)) → ((𝐸‘0) = (𝐸‘(♯‘𝐷)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
27263ad2ant2 1127 . . . . . . . . . . . . . . . . . 18 ((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) → ((𝐸‘0) = (𝐸‘(♯‘𝐷)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
2827com12 32 . . . . . . . . . . . . . . . . 17 ((𝐸‘0) = (𝐸‘(♯‘𝐷)) → ((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
29283ad2ant2 1127 . . . . . . . . . . . . . . . 16 ((𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ) → ((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))))
3029impcom 394 . . . . . . . . . . . . . . 15 (((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷))))
3130adantr 466 . . . . . . . . . . . . . 14 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷))))
3231imp 393 . . . . . . . . . . . . 13 (((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) ∧ (𝐵‘0) = (𝐸‘0)) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐷)))
33 fveq2 6332 . . . . . . . . . . . . . . . 16 ((♯‘𝐷) = (♯‘𝐴) → (𝐸‘(♯‘𝐷)) = (𝐸‘(♯‘𝐴)))
3433eqcoms 2778 . . . . . . . . . . . . . . 15 ((♯‘𝐴) = (♯‘𝐷) → (𝐸‘(♯‘𝐷)) = (𝐸‘(♯‘𝐴)))
3534adantl 467 . . . . . . . . . . . . . 14 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → (𝐸‘(♯‘𝐷)) = (𝐸‘(♯‘𝐴)))
3635adantr 466 . . . . . . . . . . . . 13 (((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) ∧ (𝐵‘0) = (𝐸‘0)) → (𝐸‘(♯‘𝐷)) = (𝐸‘(♯‘𝐴)))
3732, 36eqtrd 2804 . . . . . . . . . . . 12 (((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) ∧ (𝐵‘0) = (𝐸‘0)) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴)))
3837ex 397 . . . . . . . . . . 11 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → ((𝐵‘0) = (𝐸‘0) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
3919, 38syld 47 . . . . . . . . . 10 ((((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) ∧ (♯‘𝐴) = (♯‘𝐷)) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
4039ex 397 . . . . . . . . 9 (((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) ∧ (𝐷(Walks‘𝐺)𝐸 ∧ (𝐸‘0) = (𝐸‘(♯‘𝐷)) ∧ (♯‘𝐷) ∈ ℕ)) → ((♯‘𝐴) = (♯‘𝐷) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴)))))
418, 9, 40syl2an 575 . . . . . . . 8 ((𝑈𝐶𝑊𝐶) → ((♯‘𝐴) = (♯‘𝐷) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴)))))
4241impd 396 . . . . . . 7 ((𝑈𝐶𝑊𝐶) → (((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖)) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
43423adant3 1125 . . . . . 6 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → (((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖)) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
4443imp 393 . . . . 5 (((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) ∧ ((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))) → (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴)))
457, 44jca 495 . . . 4 (((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) ∧ ((♯‘𝐴) = (♯‘𝐷) ∧ ∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) ∧ (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
466, 45mpdan 659 . . 3 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) ∧ (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
47 fvex 6342 . . . 4 (♯‘𝐴) ∈ V
48 fveq2 6332 . . . . . 6 (𝑖 = (♯‘𝐴) → (𝐵𝑖) = (𝐵‘(♯‘𝐴)))
49 fveq2 6332 . . . . . 6 (𝑖 = (♯‘𝐴) → (𝐸𝑖) = (𝐸‘(♯‘𝐴)))
5048, 49eqeq12d 2785 . . . . 5 (𝑖 = (♯‘𝐴) → ((𝐵𝑖) = (𝐸𝑖) ↔ (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
5150ralunsn 4558 . . . 4 ((♯‘𝐴) ∈ V → (∀𝑖 ∈ ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)})(𝐵𝑖) = (𝐸𝑖) ↔ (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) ∧ (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴)))))
5247, 51ax-mp 5 . . 3 (∀𝑖 ∈ ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)})(𝐵𝑖) = (𝐸𝑖) ↔ (∀𝑖 ∈ (0..^(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) ∧ (𝐵‘(♯‘𝐴)) = (𝐸‘(♯‘𝐴))))
5346, 52sylibr 224 . 2 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → ∀𝑖 ∈ ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)})(𝐵𝑖) = (𝐸𝑖))
54 nnnn0 11500 . . . . . . . 8 ((♯‘𝐴) ∈ ℕ → (♯‘𝐴) ∈ ℕ0)
55 elnn0uz 11926 . . . . . . . 8 ((♯‘𝐴) ∈ ℕ0 ↔ (♯‘𝐴) ∈ (ℤ‘0))
5654, 55sylib 208 . . . . . . 7 ((♯‘𝐴) ∈ ℕ → (♯‘𝐴) ∈ (ℤ‘0))
57563ad2ant3 1128 . . . . . 6 ((𝐴(Walks‘𝐺)𝐵 ∧ (𝐵‘0) = (𝐵‘(♯‘𝐴)) ∧ (♯‘𝐴) ∈ ℕ) → (♯‘𝐴) ∈ (ℤ‘0))
588, 57syl 17 . . . . 5 (𝑈𝐶 → (♯‘𝐴) ∈ (ℤ‘0))
59583ad2ant1 1126 . . . 4 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → (♯‘𝐴) ∈ (ℤ‘0))
60 fzisfzounsn 12787 . . . 4 ((♯‘𝐴) ∈ (ℤ‘0) → (0...(♯‘𝐴)) = ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)}))
6159, 60syl 17 . . 3 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → (0...(♯‘𝐴)) = ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)}))
6261raleqdv 3292 . 2 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → (∀𝑖 ∈ (0...(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖) ↔ ∀𝑖 ∈ ((0..^(♯‘𝐴)) ∪ {(♯‘𝐴)})(𝐵𝑖) = (𝐸𝑖)))
6353, 62mpbird 247 1 ((𝑈𝐶𝑊𝐶 ∧ (𝐵 substr ⟨0, (♯‘𝐴)⟩) = (𝐸 substr ⟨0, (♯‘𝐷)⟩)) → ∀𝑖 ∈ (0...(♯‘𝐴))(𝐵𝑖) = (𝐸𝑖))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1070   = wceq 1630  wcel 2144  wral 3060  {crab 3064  Vcvv 3349  cun 3719  {csn 4314  cop 4320   class class class wbr 4784  cfv 6031  (class class class)co 6792  1st c1st 7312  2nd c2nd 7313  0cc0 10137  1c1 10138  cle 10276  cn 11221  0cn0 11493  cuz 11887  ...cfz 12532  ..^cfzo 12672  chash 13320   substr csubstr 13490  Walkscwlks 26726  ClWalkscclwlks 26900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095  ax-cnex 10193  ax-resscn 10194  ax-1cn 10195  ax-icn 10196  ax-addcl 10197  ax-addrcl 10198  ax-mulcl 10199  ax-mulrcl 10200  ax-mulcom 10201  ax-addass 10202  ax-mulass 10203  ax-distr 10204  ax-i2m1 10205  ax-1ne0 10206  ax-1rid 10207  ax-rnegex 10208  ax-rrecex 10209  ax-cnre 10210  ax-pre-lttri 10211  ax-pre-lttrn 10212  ax-pre-ltadd 10213  ax-pre-mulgt0 10214
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-ifp 1049  df-3or 1071  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-nel 3046  df-ral 3065  df-rex 3066  df-reu 3067  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-pss 3737  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-tp 4319  df-op 4321  df-uni 4573  df-int 4610  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-tr 4885  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-riota 6753  df-ov 6795  df-oprab 6796  df-mpt2 6797  df-om 7212  df-1st 7314  df-2nd 7315  df-wrecs 7558  df-recs 7620  df-rdg 7658  df-1o 7712  df-oadd 7716  df-er 7895  df-map 8010  df-pm 8011  df-en 8109  df-dom 8110  df-sdom 8111  df-fin 8112  df-card 8964  df-pnf 10277  df-mnf 10278  df-xr 10279  df-ltxr 10280  df-le 10281  df-sub 10469  df-neg 10470  df-nn 11222  df-n0 11494  df-z 11579  df-uz 11888  df-fz 12533  df-fzo 12673  df-hash 13321  df-word 13494  df-substr 13498  df-wlks 26729  df-clwlks 26901
This theorem is referenced by:  clwlkclwwlkf1  27157
  Copyright terms: Public domain W3C validator