Theorem wkslem2 29644

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 6920	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑃‘𝐴) = (𝑃‘𝐵))
2	1	adantr 480	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘𝐴) = (𝑃‘𝐵))
3		fveq2 6920	. . . 4 ⊢ ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
4	3	adantl 481	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃‘𝐶))
5	2, 4	eqeq12d 2756	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃‘𝐵) = (𝑃‘𝐶)))
6		2fveq3 6925	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
7	1	sneqd 4660	. . . 4 ⊢ (𝐴 = 𝐵 → {(𝑃‘𝐴)} = {(𝑃‘𝐵)})
8	6, 7	eqeq12d 2756	. . 3 ⊢ (𝐴 = 𝐵 → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
9	8	adantr 480	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)} ↔ (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}))
10	2, 4	preq12d 4766	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃‘𝐵), (𝑃‘𝐶)})
11	6	adantr 480	. . 3 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹‘𝐴)) = (𝐼‘(𝐹‘𝐵)))
12	10, 11	sseq12d 4042	. 2 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴)) ↔ {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵))))
13	5, 9, 12	ifpbi123d 1079	1 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃‘𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹‘𝐴)) = {(𝑃‘𝐴)}, {(𝑃‘𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹‘𝐴))) ↔ if-((𝑃‘𝐵) = (𝑃‘𝐶), (𝐼‘(𝐹‘𝐵)) = {(𝑃‘𝐵)}, {(𝑃‘𝐵), (𝑃‘𝐶)} ⊆ (𝐼‘(𝐹‘𝐵)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  if-wif 1063   = wceq 1537   ⊆ wss 3976  {csn 4648  {cpr 4650  ‘cfv 6573  (class class class)co 7448  1c1 11185   + caddc 11187

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-ifp 1064  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581

This theorem is referenced by:  wlkl1loop  29674  wlk1walk  29675  crctcshwlkn0lem6  29848  1wlkdlem4  30172