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

Theorem wwlksnon0 26715
Description: Conditions for a set of walks of a fixed length between two vertices to be empty. (Contributed by AV, 15-May-2021.) (Proof shortened by AV, 21-May-2021.)
Hypothesis
Ref Expression
wwlksnon0.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
wwlksnon0 (¬ ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ (𝐴𝑉𝐵𝑉)) → (𝐴(𝑁 WWalksNOn 𝐺)𝐵) = ∅)

Proof of Theorem wwlksnon0
Dummy variables 𝑎 𝑏 𝑔 𝑛 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-wwlksnon 26627 . 2 WWalksNOn = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ (𝑎 ∈ (Vtx‘𝑔), 𝑏 ∈ (Vtx‘𝑔) ↦ {𝑤 ∈ (𝑛 WWalksN 𝑔) ∣ ((𝑤‘0) = 𝑎 ∧ (𝑤𝑛) = 𝑏)}))
2 wwlksnon0.v . . 3 𝑉 = (Vtx‘𝐺)
32wwlksnon 26641 . 2 ((𝑁 ∈ ℕ0𝐺 ∈ V) → (𝑁 WWalksNOn 𝐺) = (𝑎𝑉, 𝑏𝑉 ↦ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑎 ∧ (𝑤𝑁) = 𝑏)}))
41, 32mpt20 6847 1 (¬ ((𝑁 ∈ ℕ0𝐺 ∈ V) ∧ (𝐴𝑉𝐵𝑉)) → (𝐴(𝑁 WWalksNOn 𝐺)𝐵) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1480  wcel 1987  {crab 2912  Vcvv 3190  c0 3897  cfv 5857  (class class class)co 6615  cmpt2 6617  0cc0 9896  0cn0 11252  Vtxcvtx 25808   WWalksN cwwlksn 26621   WWalksNOn cwwlksnon 26622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-1st 7128  df-2nd 7129  df-wwlksnon 26627
This theorem is referenced by:  wwlksnonfi  26719
  Copyright terms: Public domain W3C validator