clwlknf1oclwwlknlem2 - Metamath Proof Explorer

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

Theorem clwlknf1oclwwlknlem2 27853

Description: Lemma 2 for clwlknf1oclwwlkn 27855: The closed walks of a positive length are nonempty closed walks of this length. (Contributed by AV, 26-May-2022.)

**Assertion**
Ref	Expression
clwlknf1oclwwlknlem2	⊢ (𝑁 ∈ ℕ → {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} = {𝑐 ∈ (ClWalks‘𝐺) ∣ (1 ≤ (♯‘(1^st ‘𝑐)) ∧ (♯‘(1^st ‘𝑐)) = 𝑁)})

Distinct variable groups: 𝐺,𝑐,𝑤 𝑁,𝑐,𝑤

**Proof of Theorem clwlknf1oclwwlknlem2**
Step	Hyp	Ref	Expression
1		2fveq3 6668	. . . 4 ⊢ (𝑤 = 𝑐 → (♯‘(1^st ‘𝑤)) = (♯‘(1^st ‘𝑐)))
2	1	eqeq1d 2821	. . 3 ⊢ (𝑤 = 𝑐 → ((♯‘(1^st ‘𝑤)) = 𝑁 ↔ (♯‘(1^st ‘𝑐)) = 𝑁))
3	2	cbvrabv 3490	. 2 ⊢ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} = {𝑐 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑐)) = 𝑁}
4		nnge1 11657	. . . . 5 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁)
5		breq2 5061	. . . . 5 ⊢ ((♯‘(1^st ‘𝑐)) = 𝑁 → (1 ≤ (♯‘(1^st ‘𝑐)) ↔ 1 ≤ 𝑁))
6	4, 5	syl5ibrcom 249	. . . 4 ⊢ (𝑁 ∈ ℕ → ((♯‘(1^st ‘𝑐)) = 𝑁 → 1 ≤ (♯‘(1^st ‘𝑐))))
7	6	pm4.71rd 565	. . 3 ⊢ (𝑁 ∈ ℕ → ((♯‘(1^st ‘𝑐)) = 𝑁 ↔ (1 ≤ (♯‘(1^st ‘𝑐)) ∧ (♯‘(1^st ‘𝑐)) = 𝑁)))
8	7	rabbidv 3479	. 2 ⊢ (𝑁 ∈ ℕ → {𝑐 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑐)) = 𝑁} = {𝑐 ∈ (ClWalks‘𝐺) ∣ (1 ≤ (♯‘(1^st ‘𝑐)) ∧ (♯‘(1^st ‘𝑐)) = 𝑁)})
9	3, 8	syl5eq 2866	1 ⊢ (𝑁 ∈ ℕ → {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} = {𝑐 ∈ (ClWalks‘𝐺) ∣ (1 ≤ (♯‘(1^st ‘𝑐)) ∧ (♯‘(1^st ‘𝑐)) = 𝑁)})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1530 ∈ wcel 2107 {crab 3140 class class class wbr 5057 ‘cfv 6348 1^st c1st 7679 1c1 10530 ≤ cle 10668 ℕcn 11630 ♯chash 13682 ClWalkscclwlks 27543

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1904 ax-6 1963 ax-7 2008 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2153 ax-12 2169 ax-ext 2791 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1082 df-3an 1083 df-tru 1533 df-ex 1774 df-nf 1778 df-sb 2063 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-er 8281 df-en 8502 df-dom 8503 df-sdom 8504 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-nn 11631

This theorem is referenced by: clwlknf1oclwwlkn 27855

W3C validator