wkslem2 - Metamath Proof Explorer

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

Theorem wkslem2 30201

Description: Lemma 2 for walks to substitute the index of the condition for vertices and edges in a walk. (Contributed by AV, 23-Apr-2021.)

**Assertion**
Ref	Expression
wkslem2	⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵)))))

**Proof of Theorem wkslem2**
Step	Hyp	Ref	Expression
1		fveq2 6893	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑃‘𝐴) = (𝑃‘𝐵))
2	1	adantr 486	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘𝐴) = (𝑃‘𝐵))
3		fveq2 6893	. . . 4 ⊢ ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
4	3	adantl 487	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
5	2, 4	eqeq12d 2779	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃‘𝐵) = (𝑃‘𝐶)))
6		2fveq3 6898	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
7	1	sneqd 4595	. . . 4 ⊢ (𝐴 = 𝐵 → {(𝑃‘𝐴)} = {(𝑃‘𝐵)})
8	6, 7	eqeq12d 2779	. . 3 ⊢ (𝐴 = 𝐵 → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
9	8	adantr 486	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
10	2, 4	preq12d 4701	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃‘𝐵), (𝑃‘𝐶)})
11	6	adantr 486	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
12	10, 11	sseq12d 3945	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴)) ↔ {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵))))
13	5, 9, 12	ifpbi123d 1095	1 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵)))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 if-wif 1078 = wceq 1569 ⊆ wss 3899 {csn 4587 {cpr 4589 ‘cfv 6546 (class class class)co 7427 1c1 11211 + caddc 11213

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-iota 6500 df-fv 6554

This theorem is used by: wlkl1loop 30230 wlk1walk 30231 crctcshwlkn0lem6 30416 1wlkdlem4 30743

W3C validator