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

Theorem 2wlklem 16420
Description: Lemma for theorems for walks of length 2. (Contributed by Alexander van der Vekens, 1-Feb-2018.)
Assertion
Ref Expression
2wlklem (∀𝑘 ∈ {0, 1} (𝐸‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ ((𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
Distinct variable groups:   𝑘,𝐸   𝑘,𝐹   𝑃,𝑘

Proof of Theorem 2wlklem
StepHypRef Expression
1 c0ex 8273 . 2 0 ∈ V
2 1ex 8274 . 2 1 ∈ V
3 2fveq3 5677 . . 3 (𝑘 = 0 → (𝐸‘(𝐹𝑘)) = (𝐸‘(𝐹‘0)))
4 fveq2 5672 . . . 4 (𝑘 = 0 → (𝑃𝑘) = (𝑃‘0))
5 fv0p1e1 9357 . . . 4 (𝑘 = 0 → (𝑃‘(𝑘 + 1)) = (𝑃‘1))
64, 5preq12d 3778 . . 3 (𝑘 = 0 → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} = {(𝑃‘0), (𝑃‘1)})
73, 6eqeq12d 2249 . 2 (𝑘 = 0 → ((𝐸‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ (𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)}))
8 2fveq3 5677 . . 3 (𝑘 = 1 → (𝐸‘(𝐹𝑘)) = (𝐸‘(𝐹‘1)))
9 fveq2 5672 . . . 4 (𝑘 = 1 → (𝑃𝑘) = (𝑃‘1))
10 oveq1 6059 . . . . . 6 (𝑘 = 1 → (𝑘 + 1) = (1 + 1))
11 1p1e2 9359 . . . . . 6 (1 + 1) = 2
1210, 11eqtrdi 2283 . . . . 5 (𝑘 = 1 → (𝑘 + 1) = 2)
1312fveq2d 5676 . . . 4 (𝑘 = 1 → (𝑃‘(𝑘 + 1)) = (𝑃‘2))
149, 13preq12d 3778 . . 3 (𝑘 = 1 → {(𝑃𝑘), (𝑃‘(𝑘 + 1))} = {(𝑃‘1), (𝑃‘2)})
158, 14eqeq12d 2249 . 2 (𝑘 = 1 → ((𝐸‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
161, 2, 7, 15ralpr 3746 1 (∀𝑘 ∈ {0, 1} (𝐸‘(𝐹𝑘)) = {(𝑃𝑘), (𝑃‘(𝑘 + 1))} ↔ ((𝐸‘(𝐹‘0)) = {(𝑃‘0), (𝑃‘1)} ∧ (𝐸‘(𝐹‘1)) = {(𝑃‘1), (𝑃‘2)}))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  wral 2522  {cpr 3692  cfv 5354  (class class class)co 6052  0cc0 8132  1c1 8133   + caddc 8135  2c2 9293
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-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  ax-1cn 8225  ax-icn 8227  ax-addcl 8228  ax-mulcl 8230  ax-addcom 8232  ax-i2m1 8237  ax-0id 8240
This theorem depends on definitions:  df-bi 117  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-ral 2527  df-rex 2528  df-v 2817  df-sbc 3045  df-un 3217  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-iota 5314  df-fv 5362  df-ov 6055  df-2 9301
This theorem is referenced by:  upgr2wlkdc  16421
  Copyright terms: Public domain W3C validator