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 28030

Description: Lemma for wlkp1 28038. (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 27972	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ₀)
3		wlkp1.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
4	3	wlkp 27973	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
5	2, 4	jca 512	. 2 ⊢ (𝐹(Walks‘𝐺)𝑃 → ((♯‘𝐹) ∈ ℕ₀ ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉))
6		fzp1nel 13331	. . . . . 6 ⊢ ¬ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹))
7	6	a1i 11	. . . . 5 ⊢ ((♯‘𝐹) ∈ ℕ₀ → ¬ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹)))
8		wlkp1.n	. . . . . . 7 ⊢ 𝑁 = (♯‘𝐹)
9	8	oveq1i 7279	. . . . . 6 ⊢ (𝑁 + 1) = ((♯‘𝐹) + 1)
10	9	eleq1i 2831	. . . . 5 ⊢ ((𝑁 + 1) ∈ (0...(♯‘𝐹)) ↔ ((♯‘𝐹) + 1) ∈ (0...(♯‘𝐹)))
11	7, 10	sylnibr 329	. . . 4 ⊢ ((♯‘𝐹) ∈ ℕ₀ → ¬ (𝑁 + 1) ∈ (0...(♯‘𝐹)))
12		eleq2 2829	. . . . 5 ⊢ (dom 𝑃 = (0...(♯‘𝐹)) → ((𝑁 + 1) ∈ dom 𝑃 ↔ (𝑁 + 1) ∈ (0...(♯‘𝐹))))
13	12	notbid 318	. . . 4 ⊢ (dom 𝑃 = (0...(♯‘𝐹)) → (¬ (𝑁 + 1) ∈ dom 𝑃 ↔ ¬ (𝑁 + 1) ∈ (0...(♯‘𝐹))))
14	11, 13	syl5ibrcom 246	. . 3 ⊢ ((♯‘𝐹) ∈ ℕ₀ → (dom 𝑃 = (0...(♯‘𝐹)) → ¬ (𝑁 + 1) ∈ dom 𝑃))
15		fdm 6606	. . 3 ⊢ (𝑃:(0...(♯‘𝐹))⟶𝑉 → dom 𝑃 = (0...(♯‘𝐹)))
16	14, 15	impel 506	. 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 396 = wceq 1542 ∈ wcel 2110 class class class wbr 5079 dom cdm 5589 Fun wfun 6425 ⟶wf 6427 ‘cfv 6431 (class class class)co 7269 Fincfn 8708 0cc0 10864 1c1 10865 + caddc 10867 ℕ₀cn0 12225 ...cfz 13230 ♯chash 14034 Vtxcvtx 27356 iEdgciedg 27357 Walkscwlks 27953

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7580 ax-cnex 10920 ax-resscn 10921 ax-1cn 10922 ax-icn 10923 ax-addcl 10924 ax-addrcl 10925 ax-mulcl 10926 ax-mulrcl 10927 ax-mulcom 10928 ax-addass 10929 ax-mulass 10930 ax-distr 10931 ax-i2m1 10932 ax-1ne0 10933 ax-1rid 10934 ax-rnegex 10935 ax-rrecex 10936 ax-cnre 10937 ax-pre-lttri 10938 ax-pre-lttrn 10939 ax-pre-ltadd 10940 ax-pre-mulgt0 10941

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ifp 1061 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4846 df-int 4886 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6200 df-ord 6267 df-on 6268 df-lim 6269 df-suc 6270 df-iota 6389 df-fun 6433 df-fn 6434 df-f 6435 df-f1 6436 df-fo 6437 df-f1o 6438 df-fv 6439 df-riota 7226 df-ov 7272 df-oprab 7273 df-mpo 7274 df-om 7702 df-1st 7818 df-2nd 7819 df-frecs 8082 df-wrecs 8113 df-recs 8187 df-rdg 8226 df-1o 8282 df-er 8473 df-map 8592 df-en 8709 df-dom 8710 df-sdom 8711 df-fin 8712 df-card 9690 df-pnf 11004 df-mnf 11005 df-xr 11006 df-ltxr 11007 df-le 11008 df-sub 11199 df-neg 11200 df-nn 11966 df-n0 12226 df-z 12312 df-uz 12574 df-fz 13231 df-fzo 13374 df-hash 14035 df-word 14208 df-wlks 27956

This theorem is referenced by: wlkp1lem7 28036 wlkp1lem8 28037 eupth2eucrct 28569

W3C validator