Metamath Proof Explorer


Theorem clwlknf1oclwwlknlem2

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

Ref Expression
Assertion clwlknf1oclwwlknlem2 ⊢ N ∈ ℕ → w ∈ ClWalks ⁡ G | 1 st ⁡ w = N = c ∈ ClWalks ⁡ G | 1 ≤ 1 st ⁡ c ∧ 1 st ⁡ c = N

Proof

Step Hyp Ref Expression
1 2fveq3 ⊢ w = c → 1 st ⁡ w = 1 st ⁡ c
2 1 eqeq1d ⊢ w = c → 1 st ⁡ w = N ↔ 1 st ⁡ c = N
3 2 cbvrabv ⊢ w ∈ ClWalks ⁡ G | 1 st ⁡ w = N = c ∈ ClWalks ⁡ G | 1 st ⁡ c = N
4 nnge1 ⊢ N ∈ ℕ → 1 ≤ N
5 breq2 ⊢ 1 st ⁡ c = N → 1 ≤ 1 st ⁡ c ↔ 1 ≤ N
6 4 5 syl5ibrcom ⊢ N ∈ ℕ → 1 st ⁡ c = N → 1 ≤ 1 st ⁡ c
7 6 pm4.71rd ⊢ N ∈ ℕ → 1 st ⁡ c = N ↔ 1 ≤ 1 st ⁡ c ∧ 1 st ⁡ c = N
8 7 rabbidv ⊢ N ∈ ℕ → c ∈ ClWalks ⁡ G | 1 st ⁡ c = N = c ∈ ClWalks ⁡ G | 1 ≤ 1 st ⁡ c ∧ 1 st ⁡ c = N
9 3 8 eqtrid ⊢ N ∈ ℕ → w ∈ ClWalks ⁡ G | 1 st ⁡ w = N = c ∈ ClWalks ⁡ G | 1 ≤ 1 st ⁡ c ∧ 1 st ⁡ c = N