Theorem wkslem2 29958

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 6881	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑃‘𝐴) = (𝑃‘𝐵))
2	1	adantr 485	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘𝐴) = (𝑃‘𝐵))
3		fveq2 6881	. . . 4 ⊢ ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
4	3	adantl 486	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
5	2, 4	eqeq12d 2779	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃‘𝐵) = (𝑃‘𝐶)))
6		2fveq3 6886	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
7	1	sneqd 4601	. . . 4 ⊢ (𝐴 = 𝐵 → {(𝑃‘𝐴)} = {(𝑃‘𝐵)})
8	6, 7	eqeq12d 2779	. . 3 ⊢ (𝐴 = 𝐵 → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
9	8	adantr 485	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
10	2, 4	preq12d 4707	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃‘𝐵), (𝑃‘𝐶)})
11	6	adantr 485	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
12	10, 11	sseq12d 3970	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴)) ↔ {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵))))
13	5, 9, 12	ifpbi123d 1095	1 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵)))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  if-wif 1078   = wceq 1570   ⊆ wss 3905  {csn 4589  {cpr 4591  ‘cfv 6536  (class class class)co 7410  1c1 11096   + caddc 11098

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ifp 1079  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544

This theorem is referenced by:  wlkl1loop  29987  wlk1walk  29988  crctcshwlkn0lem6  30164  1wlkdlem4  30491