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

Theorem 0wlkonlem2 30120
Description: Lemma 2 for 0wlkon 30121 and 0trlon 30125. (Contributed by AV, 3-Jan-2021.) (Revised by AV, 23-Mar-2021.)
Hypothesis
Ref Expression
0wlk.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
0wlkonlem2 ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃 ∈ (𝑉pm (0...0)))

Proof of Theorem 0wlkonlem2
StepHypRef Expression
1 ovex 7388 . 2 (0...0) ∈ V
2 0wlk.v . . 3 𝑉 = (Vtx‘𝐺)
32fvexi 6845 . 2 𝑉 ∈ V
4 simpl 482 . 2 ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃:(0...0)⟶𝑉)
5 fpmg 8802 . 2 (((0...0) ∈ V ∧ 𝑉 ∈ V ∧ 𝑃:(0...0)⟶𝑉) → 𝑃 ∈ (𝑉pm (0...0)))
61, 3, 4, 5mp3an12i 1467 1 ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃 ∈ (𝑉pm (0...0)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3437  wf 6485  cfv 6489  (class class class)co 7355  pm cpm 8760  0cc0 11017  ...cfz 13414  Vtxcvtx 28995
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-pm 8762
This theorem is referenced by:  0wlkon  30121  0trlon  30125  0pthon  30128
  Copyright terms: Public domain W3C validator