eupth2lem3 - Metamath Proof Explorer

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

Theorem eupth2lem3 28501

Description: Lemma for eupth2 28504. (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‘𝐺)𝑃)
eupth2.h	⊢ 𝐻 = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩
eupth2.x	⊢ 𝑋 = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩
eupth2.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
eupth2.l	⊢ (𝜑 → (𝑁 + 1) ≤ (♯‘𝐹))
eupth2.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
eupth2.o	⊢ (𝜑 → {𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐻)‘𝑥)} = if((𝑃‘0) = (𝑃‘𝑁), ∅, {(𝑃‘0), (𝑃‘𝑁)}))

**Assertion**
Ref	Expression
eupth2lem3	⊢ (𝜑 → (¬ 2 ∥ ((VtxDeg‘𝑋)‘𝑈) ↔ 𝑈 ∈ if((𝑃‘0) = (𝑃‘(𝑁 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑁 + 1))})))

Distinct variable groups: 𝑥,𝐻 𝑥,𝑈 𝑥,𝑉 Allowed substitution hints: 𝜑(𝑥) 𝑃(𝑥) 𝐹(𝑥) 𝐺(𝑥) 𝐼(𝑥) 𝑁(𝑥) 𝑋(𝑥)

Proof of Theorem eupth2lem3 Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eupth2.v	. 2 ⊢ 𝑉 = (Vtx‘𝐺)
2		eupth2.i	. 2 ⊢ 𝐼 = (iEdg‘𝐺)
3		eupth2.f	. 2 ⊢ (𝜑 → Fun 𝐼)
4		eupth2.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
5		eupth2.p	. . . 4 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃)
6		eupthiswlk 28477	. . . 4 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃)
7		wlkcl 27885	. . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ₀)
8	5, 6, 7	3syl 18	. . 3 ⊢ (𝜑 → (♯‘𝐹) ∈ ℕ₀)
9		eupth2.l	. . 3 ⊢ (𝜑 → (𝑁 + 1) ≤ (♯‘𝐹))
10		nn0p1elfzo 13358	. . 3 ⊢ ((𝑁 ∈ ℕ₀ ∧ (♯‘𝐹) ∈ ℕ₀ ∧ (𝑁 + 1) ≤ (♯‘𝐹)) → 𝑁 ∈ (0..^(♯‘𝐹)))
11	4, 8, 9, 10	syl3anc 1369	. 2 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
12		eupth2.u	. 2 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
13		eupthistrl 28476	. . 3 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃)
14	5, 13	syl 17	. 2 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)
15		eupth2.h	. . . . 5 ⊢ 𝐻 = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩
16	15	fveq2i 6759	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩)
17	1	fvexi 6770	. . . . 5 ⊢ 𝑉 ∈ V
18	2	fvexi 6770	. . . . . 6 ⊢ 𝐼 ∈ V
19	18	resex 5928	. . . . 5 ⊢ (𝐼 ↾ (𝐹 “ (0..^𝑁))) ∈ V
20	17, 19	opvtxfvi 27282	. . . 4 ⊢ (Vtx‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩) = 𝑉
21	16, 20	eqtri 2766	. . 3 ⊢ (Vtx‘𝐻) = 𝑉
22	21	a1i 11	. 2 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉)
23		snex 5349	. . . 4 ⊢ {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩} ∈ V
24	17, 23	opvtxfvi 27282	. . 3 ⊢ (Vtx‘⟨𝑉, {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}⟩) = 𝑉
25	24	a1i 11	. 2 ⊢ (𝜑 → (Vtx‘⟨𝑉, {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}⟩) = 𝑉)
26		eupth2.x	. . . . 5 ⊢ 𝑋 = ⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩
27	26	fveq2i 6759	. . . 4 ⊢ (Vtx‘𝑋) = (Vtx‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩)
28	18	resex 5928	. . . . 5 ⊢ (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1)))) ∈ V
29	17, 28	opvtxfvi 27282	. . . 4 ⊢ (Vtx‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩) = 𝑉
30	27, 29	eqtri 2766	. . 3 ⊢ (Vtx‘𝑋) = 𝑉
31	30	a1i 11	. 2 ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉)
32	15	fveq2i 6759	. . . 4 ⊢ (iEdg‘𝐻) = (iEdg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩)
33	17, 19	opiedgfvi 27283	. . . 4 ⊢ (iEdg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^𝑁)))⟩) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))
34	32, 33	eqtri 2766	. . 3 ⊢ (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))
35	34	a1i 11	. 2 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
36	17, 23	opiedgfvi 27283	. . 3 ⊢ (iEdg‘⟨𝑉, {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}⟩) = {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}
37	36	a1i 11	. 2 ⊢ (𝜑 → (iEdg‘⟨𝑉, {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩}⟩) = {⟨(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))⟩})
38	26	fveq2i 6759	. . . 4 ⊢ (iEdg‘𝑋) = (iEdg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩)
39	17, 28	opiedgfvi 27283	. . . 4 ⊢ (iEdg‘⟨𝑉, (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))⟩) = (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))
40	38, 39	eqtri 2766	. . 3 ⊢ (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1))))
41	4	nn0zd 12353	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
42		fzval3 13384	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → (0...𝑁) = (0..^(𝑁 + 1)))
43	42	eqcomd 2744	. . . . . 6 ⊢ (𝑁 ∈ ℤ → (0..^(𝑁 + 1)) = (0...𝑁))
44	41, 43	syl 17	. . . . 5 ⊢ (𝜑 → (0..^(𝑁 + 1)) = (0...𝑁))
45	44	imaeq2d 5958	. . . 4 ⊢ (𝜑 → (𝐹 “ (0..^(𝑁 + 1))) = (𝐹 “ (0...𝑁)))
46	45	reseq2d 5880	. . 3 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(𝑁 + 1)))) = (𝐼 ↾ (𝐹 “ (0...𝑁))))
47	40, 46	syl5eq 2791	. 2 ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0...𝑁))))
48		eupth2.o	. 2 ⊢ (𝜑 → {𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐻)‘𝑥)} = if((𝑃‘0) = (𝑃‘𝑁), ∅, {(𝑃‘0), (𝑃‘𝑁)}))
49		2fveq3 6761	. . . 4 ⊢ (𝑘 = 𝑁 → (𝐼‘(𝐹‘𝑘)) = (𝐼‘(𝐹‘𝑁)))
50		fveq2 6756	. . . . 5 ⊢ (𝑘 = 𝑁 → (𝑃‘𝑘) = (𝑃‘𝑁))
51		fvoveq1 7278	. . . . 5 ⊢ (𝑘 = 𝑁 → (𝑃‘(𝑘 + 1)) = (𝑃‘(𝑁 + 1)))
52	50, 51	preq12d 4674	. . . 4 ⊢ (𝑘 = 𝑁 → {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} = {(𝑃‘𝑁), (𝑃‘(𝑁 + 1))})
53	49, 52	eqeq12d 2754	. . 3 ⊢ (𝑘 = 𝑁 → ((𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ↔ (𝐼‘(𝐹‘𝑁)) = {(𝑃‘𝑁), (𝑃‘(𝑁 + 1))}))
54		eupth2.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ UPGraph)
55	5, 6	syl 17	. . . 4 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
56	2	upgrwlkedg 27911	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐹(Walks‘𝐺)𝑃) → ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})
57	54, 55, 56	syl2anc 583	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})
58	53, 57, 11	rspcdva 3554	. 2 ⊢ (𝜑 → (𝐼‘(𝐹‘𝑁)) = {(𝑃‘𝑁), (𝑃‘(𝑁 + 1))})
59	1, 2, 3, 11, 12, 14, 22, 25, 31, 35, 37, 47, 48, 58	eupth2lem3lem7 28499	1 ⊢ (𝜑 → (¬ 2 ∥ ((VtxDeg‘𝑋)‘𝑈) ↔ 𝑈 ∈ if((𝑃‘0) = (𝑃‘(𝑁 + 1)), ∅, {(𝑃‘0), (𝑃‘(𝑁 + 1))})))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 ∀wral 3063 {crab 3067 ∅c0 4253 ifcif 4456 {csn 4558 {cpr 4560 ⟨cop 4564 class class class wbr 5070 ↾ cres 5582 “ cima 5583 Fun wfun 6412 ‘cfv 6418 (class class class)co 7255 0cc0 10802 1c1 10803 + caddc 10805 ≤ cle 10941 2c2 11958 ℕ₀cn0 12163 ℤcz 12249 ...cfz 13168 ..^cfzo 13311 ♯chash 13972 ∥ cdvds 15891 Vtxcvtx 27269 iEdgciedg 27270 UPGraphcupgr 27353 VtxDegcvtxdg 27735 Walkscwlks 27866 Trailsctrls 27960 EulerPathsceupth 28462

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-ifp 1060 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-oadd 8271 df-er 8456 df-map 8575 df-pm 8576 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-inf 9132 df-dju 9590 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-xnn0 12236 df-z 12250 df-uz 12512 df-rp 12660 df-xadd 12778 df-fz 13169 df-fzo 13312 df-seq 13650 df-exp 13711 df-hash 13973 df-word 14146 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-dvds 15892 df-vtx 27271 df-iedg 27272 df-edg 27321 df-uhgr 27331 df-ushgr 27332 df-upgr 27355 df-uspgr 27423 df-vtxdg 27736 df-wlks 27869 df-trls 27962 df-eupth 28463

This theorem is referenced by: eupth2lems 28503

W3C validator