Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eupth2lems Structured version   Visualization version   GIF version

Theorem eupth2lems 41406
 Description: Lemma for eupth2 41407 (induction step): The only vertices of odd degree in a graph with an Eulerian path are the endpoints, and then only if the endpoints are distinct, if the Eulerian path shortened by one edge has this property. Formerly part of proof for eupth2 41407. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.)
Hypotheses
Ref Expression
eupth2.v 𝑉 = (Vtx‘𝐺)
eupth2.i 𝐼 = (iEdg‘𝐺)
eupth2.g (𝜑𝐺 ∈ UPGraph )
eupth2.f (𝜑 → Fun 𝐼)
eupth2.p (𝜑𝐹(EulerPaths‘𝐺)𝑃)
Assertion
Ref Expression
eupth2lems ((𝜑𝑛 ∈ ℕ0) → ((𝑛 ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)})) → ((𝑛 + 1) ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
Distinct variable groups:   𝜑,𝑥   𝑥,𝐹   𝑥,𝐼   𝑥,𝑉   𝑥,𝑛
Allowed substitution hints:   𝜑(𝑛)   𝑃(𝑥,𝑛)   𝐹(𝑛)   𝐺(𝑥,𝑛)   𝐼(𝑛)   𝑉(𝑛)

Proof of Theorem eupth2lems
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nn0re 11178 . . . . . 6 (𝑛 ∈ ℕ0𝑛 ∈ ℝ)
21adantl 481 . . . . 5 ((𝜑𝑛 ∈ ℕ0) → 𝑛 ∈ ℝ)
32lep1d 10834 . . . 4 ((𝜑𝑛 ∈ ℕ0) → 𝑛 ≤ (𝑛 + 1))
4 peano2re 10088 . . . . . 6 (𝑛 ∈ ℝ → (𝑛 + 1) ∈ ℝ)
52, 4syl 17 . . . . 5 ((𝜑𝑛 ∈ ℕ0) → (𝑛 + 1) ∈ ℝ)
6 eupth2.p . . . . . . . 8 (𝜑𝐹(EulerPaths‘𝐺)𝑃)
7 eupthis1wlk 41380 . . . . . . . 8 (𝐹(EulerPaths‘𝐺)𝑃𝐹(1Walks‘𝐺)𝑃)
8 1wlkcl 40820 . . . . . . . 8 (𝐹(1Walks‘𝐺)𝑃 → (#‘𝐹) ∈ ℕ0)
96, 7, 83syl 18 . . . . . . 7 (𝜑 → (#‘𝐹) ∈ ℕ0)
109nn0red 11229 . . . . . 6 (𝜑 → (#‘𝐹) ∈ ℝ)
1110adantr 480 . . . . 5 ((𝜑𝑛 ∈ ℕ0) → (#‘𝐹) ∈ ℝ)
12 letr 10010 . . . . 5 ((𝑛 ∈ ℝ ∧ (𝑛 + 1) ∈ ℝ ∧ (#‘𝐹) ∈ ℝ) → ((𝑛 ≤ (𝑛 + 1) ∧ (𝑛 + 1) ≤ (#‘𝐹)) → 𝑛 ≤ (#‘𝐹)))
132, 5, 11, 12syl3anc 1318 . . . 4 ((𝜑𝑛 ∈ ℕ0) → ((𝑛 ≤ (𝑛 + 1) ∧ (𝑛 + 1) ≤ (#‘𝐹)) → 𝑛 ≤ (#‘𝐹)))
143, 13mpand 707 . . 3 ((𝜑𝑛 ∈ ℕ0) → ((𝑛 + 1) ≤ (#‘𝐹) → 𝑛 ≤ (#‘𝐹)))
1514imim1d 80 . 2 ((𝜑𝑛 ∈ ℕ0) → ((𝑛 ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)})) → ((𝑛 + 1) ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))))
16 fveq2 6103 . . . . . . . . 9 (𝑥 = 𝑦 → ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥) = ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦))
1716breq2d 4595 . . . . . . . 8 (𝑥 = 𝑦 → (2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥) ↔ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦)))
1817notbid 307 . . . . . . 7 (𝑥 = 𝑦 → (¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥) ↔ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦)))
1918elrab 3331 . . . . . 6 (𝑦 ∈ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} ↔ (𝑦𝑉 ∧ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦)))
20 eupth2.v . . . . . . . . 9 𝑉 = (Vtx‘𝐺)
21 eupth2.i . . . . . . . . 9 𝐼 = (iEdg‘𝐺)
22 eupth2.g . . . . . . . . . 10 (𝜑𝐺 ∈ UPGraph )
2322ad3antrrr 762 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → 𝐺 ∈ UPGraph )
24 eupth2.f . . . . . . . . . 10 (𝜑 → Fun 𝐼)
2524ad3antrrr 762 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → Fun 𝐼)
266ad3antrrr 762 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → 𝐹(EulerPaths‘𝐺)𝑃)
27 eqid 2610 . . . . . . . . 9 𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩ = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩
28 eqid 2610 . . . . . . . . 9 𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩ = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩
29 simpr 476 . . . . . . . . . 10 ((𝜑𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
3029ad2antrr 758 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → 𝑛 ∈ ℕ0)
31 simprl 790 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑛 + 1) ≤ (#‘𝐹))
3231adantr 480 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → (𝑛 + 1) ≤ (#‘𝐹))
33 simpr 476 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → 𝑦𝑉)
34 simplrr 797 . . . . . . . . 9 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))
3520, 21, 23, 25, 26, 27, 28, 30, 32, 33, 34eupth2lem3 41404 . . . . . . . 8 ((((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) ∧ 𝑦𝑉) → (¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦) ↔ 𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))})))
3635pm5.32da 671 . . . . . . 7 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → ((𝑦𝑉 ∧ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦)) ↔ (𝑦𝑉𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
37 0elpw 4760 . . . . . . . . . . 11 ∅ ∈ 𝒫 𝑉
38201wlkepvtx 40868 . . . . . . . . . . . . . . . 16 (𝐹(1Walks‘𝐺)𝑃 → ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘(#‘𝐹)) ∈ 𝑉))
3938simpld 474 . . . . . . . . . . . . . . 15 (𝐹(1Walks‘𝐺)𝑃 → (𝑃‘0) ∈ 𝑉)
406, 7, 393syl 18 . . . . . . . . . . . . . 14 (𝜑 → (𝑃‘0) ∈ 𝑉)
4140ad2antrr 758 . . . . . . . . . . . . 13 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑃‘0) ∈ 𝑉)
42201wlkp 40821 . . . . . . . . . . . . . . . 16 (𝐹(1Walks‘𝐺)𝑃𝑃:(0...(#‘𝐹))⟶𝑉)
436, 7, 423syl 18 . . . . . . . . . . . . . . 15 (𝜑𝑃:(0...(#‘𝐹))⟶𝑉)
4443ad2antrr 758 . . . . . . . . . . . . . 14 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → 𝑃:(0...(#‘𝐹))⟶𝑉)
45 peano2nn0 11210 . . . . . . . . . . . . . . . . . . 19 (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ0)
4645adantl 481 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 ∈ ℕ0) → (𝑛 + 1) ∈ ℕ0)
4746adantr 480 . . . . . . . . . . . . . . . . 17 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑛 + 1) ∈ ℕ0)
48 nn0uz 11598 . . . . . . . . . . . . . . . . 17 0 = (ℤ‘0)
4947, 48syl6eleq 2698 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑛 + 1) ∈ (ℤ‘0))
509ad2antrr 758 . . . . . . . . . . . . . . . . 17 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (#‘𝐹) ∈ ℕ0)
5150nn0zd 11356 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (#‘𝐹) ∈ ℤ)
52 elfz5 12205 . . . . . . . . . . . . . . . 16 (((𝑛 + 1) ∈ (ℤ‘0) ∧ (#‘𝐹) ∈ ℤ) → ((𝑛 + 1) ∈ (0...(#‘𝐹)) ↔ (𝑛 + 1) ≤ (#‘𝐹)))
5349, 51, 52syl2anc 691 . . . . . . . . . . . . . . 15 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → ((𝑛 + 1) ∈ (0...(#‘𝐹)) ↔ (𝑛 + 1) ≤ (#‘𝐹)))
5431, 53mpbird 246 . . . . . . . . . . . . . 14 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑛 + 1) ∈ (0...(#‘𝐹)))
5544, 54ffvelrnd 6268 . . . . . . . . . . . . 13 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑃‘(𝑛 + 1)) ∈ 𝑉)
5641, 55prssd 4294 . . . . . . . . . . . 12 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → {(𝑃‘0), (𝑃‘(𝑛 + 1))} ⊆ 𝑉)
57 prex 4836 . . . . . . . . . . . . 13 {(𝑃‘0), (𝑃‘(𝑛 + 1))} ∈ V
5857elpw 4114 . . . . . . . . . . . 12 ({(𝑃‘0), (𝑃‘(𝑛 + 1))} ∈ 𝒫 𝑉 ↔ {(𝑃‘0), (𝑃‘(𝑛 + 1))} ⊆ 𝑉)
5956, 58sylibr 223 . . . . . . . . . . 11 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → {(𝑃‘0), (𝑃‘(𝑛 + 1))} ∈ 𝒫 𝑉)
60 ifcl 4080 . . . . . . . . . . 11 ((∅ ∈ 𝒫 𝑉 ∧ {(𝑃‘0), (𝑃‘(𝑛 + 1))} ∈ 𝒫 𝑉) → if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}) ∈ 𝒫 𝑉)
6137, 59, 60sylancr 694 . . . . . . . . . 10 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}) ∈ 𝒫 𝑉)
6261elpwid 4118 . . . . . . . . 9 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}) ⊆ 𝑉)
6362sseld 3567 . . . . . . . 8 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}) → 𝑦𝑉))
6463pm4.71rd 665 . . . . . . 7 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}) ↔ (𝑦𝑉𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
6536, 64bitr4d 270 . . . . . 6 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → ((𝑦𝑉 ∧ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑦)) ↔ 𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))})))
6619, 65syl5bb 271 . . . . 5 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → (𝑦 ∈ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} ↔ 𝑦 ∈ if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))})))
6766eqrdv 2608 . . . 4 (((𝜑𝑛 ∈ ℕ0) ∧ ((𝑛 + 1) ≤ (#‘𝐹) ∧ {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}))) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))
6867exp32 629 . . 3 ((𝜑𝑛 ∈ ℕ0) → ((𝑛 + 1) ≤ (#‘𝐹) → ({𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)}) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
6968a2d 29 . 2 ((𝜑𝑛 ∈ ℕ0) → (((𝑛 + 1) ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)})) → ((𝑛 + 1) ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
7015, 69syld 46 1 ((𝜑𝑛 ∈ ℕ0) → ((𝑛 ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑛)))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃𝑛), ∅, {(𝑃‘0), (𝑃𝑛)})) → ((𝑛 + 1) ≤ (#‘𝐹) → {𝑥𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑛 + 1))))⟩)‘𝑥)} = if((𝑃‘0) = (𝑃‘(𝑛 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑛 + 1))}))))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {crab 2900   ⊆ wss 3540  ∅c0 3874  ifcif 4036  𝒫 cpw 4108  {cpr 4127  ⟨cop 4131   class class class wbr 4583   ↾ cres 5040   “ cima 5041  Fun wfun 5798  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  ℝcr 9814  0cc0 9815  1c1 9816   + caddc 9818   ≤ cle 9954  2c2 10947  ℕ0cn0 11169  ℤcz 11254  ℤ≥cuz 11563  ...cfz 12197  ..^cfzo 12334  #chash 12979   ∥ cdvds 14821  Vtxcvtx 25673  iEdgciedg 25674   UPGraph cupgr 25747  VtxDegcvtxdg 40681  1Walksc1wlks 40796  EulerPathsceupth 41364 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ifp 1007  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-rp 11709  df-xadd 11823  df-fz 12198  df-fzo 12335  df-seq 12664  df-exp 12723  df-hash 12980  df-word 13154  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-dvds 14822  df-vtx 25675  df-iedg 25676  df-uhgr 25724  df-ushgr 25725  df-upgr 25749  df-edga 25793  df-uspgr 40380  df-vtxdg 40682  df-1wlks 40800  df-wlks 40801  df-trls 40901  df-eupth 41365 This theorem is referenced by:  eupth2  41407
 Copyright terms: Public domain W3C validator