ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  wkslem2 GIF version

Theorem wkslem2 16442
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 5675 . . . 4 (𝐴 = 𝐵 → (𝑃𝐴) = (𝑃𝐵))
21adantr 276 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃𝐴) = (𝑃𝐵))
3 fveq2 5675 . . . 4 ((𝐴 + 1) = 𝐶 → (𝑃‘(𝐴 + 1)) = (𝑃𝐶))
43adantl 277 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝑃‘(𝐴 + 1)) = (𝑃𝐶))
52, 4eqeq12d 2249 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝑃𝐴) = (𝑃‘(𝐴 + 1)) ↔ (𝑃𝐵) = (𝑃𝐶)))
6 2fveq3 5680 . . . 4 (𝐴 = 𝐵 → (𝐼‘(𝐹𝐴)) = (𝐼‘(𝐹𝐵)))
71sneqd 3707 . . . 4 (𝐴 = 𝐵 → {(𝑃𝐴)} = {(𝑃𝐵)})
86, 7eqeq12d 2249 . . 3 (𝐴 = 𝐵 → ((𝐼‘(𝐹𝐴)) = {(𝑃𝐴)} ↔ (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}))
98adantr 276 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ((𝐼‘(𝐹𝐴)) = {(𝑃𝐴)} ↔ (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}))
102, 4preq12d 3781 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → {(𝑃𝐴), (𝑃‘(𝐴 + 1))} = {(𝑃𝐵), (𝑃𝐶)})
116adantr 276 . . 3 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (𝐼‘(𝐹𝐴)) = (𝐼‘(𝐹𝐵)))
1210, 11sseq12d 3273 . 2 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → ({(𝑃𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹𝐴)) ↔ {(𝑃𝐵), (𝑃𝐶)} ⊆ (𝐼‘(𝐹𝐵))))
135, 9, 12ifpbi123d 1001 1 ((𝐴 = 𝐵 ∧ (𝐴 + 1) = 𝐶) → (if-((𝑃𝐴) = (𝑃‘(𝐴 + 1)), (𝐼‘(𝐹𝐴)) = {(𝑃𝐴)}, {(𝑃𝐴), (𝑃‘(𝐴 + 1))} ⊆ (𝐼‘(𝐹𝐴))) ↔ if-((𝑃𝐵) = (𝑃𝐶), (𝐼‘(𝐹𝐵)) = {(𝑃𝐵)}, {(𝑃𝐵), (𝑃𝐶)} ⊆ (𝐼‘(𝐹𝐵)))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  if-wif 986   = wceq 1398  wss 3214  {csn 3694  {cpr 3695  cfv 5357  (class class class)co 6058  1c1 8144   + caddc 8146
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-ifp 987  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-iota 5317  df-fv 5365
This theorem is referenced by:  wlkl1loop  16479  wlk1walkdom  16480
  Copyright terms: Public domain W3C validator