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

Theorem 0wlkonlem2 30410
Description: Lemma 2 for 0wlkon 30411 and 0trlon 30415. (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 7444 . 2 (0...0) ∈ V
2 0wlk.v . . 3 𝑉 = (Vtx‘𝐺)
32fvexi 6896 . 2 𝑉 ∈ V
4 simpl 487 . 2 ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃:(0...0)⟶𝑉)
5 fpmg 8865 . 2 (((0...0) ∈ V ∧ 𝑉 ∈ V ∧ 𝑃:(0...0)⟶𝑉) → 𝑃 ∈ (𝑉pm (0...0)))
61, 3, 4, 5mp3an12i 1491 1 ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃 ∈ (𝑉pm (0...0)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1567  wcel 2149  Vcvv 3463  wf 6533  cfv 6537  (class class class)co 7411  pm cpm 8824  0cc0 11099  ...cfz 13534  Vtxcvtx 29286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-pm 8826
This theorem is referenced by:  0wlkon  30411  0trlon  30415  0pthon  30418
  Copyright terms: Public domain W3C validator