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

Theorem wkslem2 27382
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
StepHypRef Expression
1 fveq2 6663 . . . 4 (𝐴 = 𝐵 → (𝑃𝐴) = (𝑃𝐵))
21adantr 483 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃𝐴) = (𝑃𝐵))
3 fveq2 6663 . . . 4 ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃𝐶))
43adantl 484 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃𝐶))
52, 4eqeq12d 2835 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃𝐵) = (𝑃𝐶)))
6 2fveq3 6668 . . . 4 (𝐴 = 𝐵 → (𝐼‘(𝐹𝐴)) = (𝐼‘(𝐹𝐵)))
71sneqd 4571 . . . 4 (𝐴 = 𝐵 → {(𝑃𝐴)} = {(𝑃𝐵)})
86, 7eqeq12d 2835 . . 3 (𝐴 = 𝐵 → ((𝐼‘(𝐹𝐴)) = {(𝑃𝐴)} ↔ (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}))
98adantr 483 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹𝐴)) = {(𝑃𝐴)} ↔ (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}))
102, 4preq12d 4669 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃𝐵), (𝑃𝐶)})
116adantr 483 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹𝐴)) = (𝐼‘(𝐹𝐵)))
1210, 11sseq12d 3998 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹𝐴)) ↔ {(𝑃𝐵), (𝑃𝐶)} ⊆ (𝐼‘(𝐹𝐵))))
135, 9, 12ifpbi123d 1072 1 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹𝐴)) = {(𝑃𝐴)}, {(𝑃𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹𝐴))) ↔ if-((𝑃𝐵) = (𝑃𝐶), (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}, {(𝑃𝐵), (𝑃𝐶)} ⊆ (𝐼‘(𝐹𝐵)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  if-wif 1057   = wceq 1531  wss 3934  {csn 4559  {cpr 4561  cfv 6348  (class class class)co 7148  1c1 10530   + caddc 10532
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ifp 1058  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-rex 3142  df-rab 3145  df-v 3495  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-iota 6307  df-fv 6356
This theorem is referenced by:  wlkl1loop  27411  wlk1walk  27412  crctcshwlkn0lem6  27585  1wlkdlem4  27911
  Copyright terms: Public domain W3C validator