wlkp1lem1 - Metamath Proof Explorer

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

Theorem wlkp1lem1 29601

Description: Lemma for wlkp1 29609. (Contributed by AV, 6-Mar-2021.)

**Hypotheses**
Ref	Expression
wlkp1.v	⊢ 𝑉 = (Vtx‘𝐺)
wlkp1.i	⊢ 𝐼 = (iEdg‘𝐺)
wlkp1.f	⊢ (𝜑 → Fun 𝐼)
wlkp1.a	⊢ (𝜑 → 𝐼 ∈ Fin)
wlkp1.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
wlkp1.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
wlkp1.d	⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼)
wlkp1.w	⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
wlkp1.n	⊢ 𝑁 = (♯‘𝐹)

**Assertion**
Ref	Expression
wlkp1lem1	⊢ (𝜑 → ¬ (𝑁 + 1) ∈ dom 𝑃)

**Proof of Theorem wlkp1lem1**
Step	Hyp	Ref	Expression
1		wlkp1.w	. 2 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
2		wlkcl 29543	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ₀)
3		wlkp1.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
4	3	wlkp 29544	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
5	2, 4	jca 511	. 2 ⊢ (𝐹(Walks‘𝐺)𝑃 → ((♯‘𝐹) ∈ ℕ₀ ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉))
6		fzp1nel 13572	. . . . . 6 ⊢ ¬ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹))
7	6	a1i 11	. . . . 5 ⊢ ((♯‘𝐹) ∈ ℕ₀ → ¬ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹)))
8		wlkp1.n	. . . . . . 7 ⊢ 𝑁 = (♯‘𝐹)
9	8	oveq1i 7397	. . . . . 6 ⊢ (𝑁 + 1) = ((♯‘𝐹) + 1)
10	9	eleq1i 2819	. . . . 5 ⊢ ((𝑁 + 1) ∈ (0...(♯‘𝐹)) ↔ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹)))
11	7, 10	sylnibr 329	. . . 4 ⊢ ((♯‘𝐹) ∈ ℕ₀ → ¬ (𝑁 + 1) ∈ (0...(♯‘𝐹)))
12		eleq2 2817	. . . . 5 ⊢ (dom 𝑃 = (0...(♯‘𝐹)) → ((𝑁 + 1) ∈ dom 𝑃 ↔ (𝑁 + 1) ∈ (0...(♯‘𝐹))))
13	12	notbid 318	. . . 4 ⊢ (dom 𝑃 = (0...(♯‘𝐹)) → (¬ (𝑁 + 1) ∈ dom 𝑃 ↔ ¬ (𝑁 + 1) ∈ (0...(♯‘𝐹))))
14	11, 13	syl5ibrcom 247	. . 3 ⊢ ((♯‘𝐹) ∈ ℕ₀ → (dom 𝑃 = (0...(♯‘𝐹)) → ¬ (𝑁 + 1) ∈ dom 𝑃))
15		fdm 6697	. . 3 ⊢ (𝑃:(0...(♯‘𝐹))⟶𝑉 → dom 𝑃 = (0...(♯‘𝐹)))
16	14, 15	impel 505	. 2 ⊢ (((♯‘𝐹) ∈ ℕ₀ ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉) → ¬ (𝑁 + 1) ∈ dom 𝑃)
17	1, 5, 16	3syl 18	1 ⊢ (𝜑 → ¬ (𝑁 + 1) ∈ dom 𝑃)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 class class class wbr 5107 dom cdm 5638 Fun wfun 6505 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 Fincfn 8918 0cc0 11068 1c1 11069 + caddc 11071 ℕ₀cn0 12442 ...cfz 13468 ♯chash 14295 Vtxcvtx 28923 iEdgciedg 28924 Walkscwlks 29524

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-fzo 13616 df-hash 14296 df-word 14479 df-wlks 29527

This theorem is referenced by: wlkp1lem7 29607 wlkp1lem8 29608 eupth2eucrct 30146

W3C validator