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

Theorem isacycgr1 30809
Description: The property of being an acyclic graph. (Contributed by BTernaryTau, 11-Oct-2023.)
Assertion
Ref Expression
isacycgr1 (𝐺 ∈ 𝑊 → (𝐺 ∈ AcyclicGraph ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅)))
Distinct variable group:   𝑓,𝐺,𝑝
Allowed substitution hints:   𝑊(𝑓, 𝑝)

Proof of Theorem isacycgr1
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6916 . . . . 5 (𝑔 = 𝐺 → (Cycles‘𝑔) = (Cycles‘𝐺))
21breqd 5119 . . . 4 (𝑔 = 𝐺 → (𝑓(Cycles‘𝑔)𝑝 ↔ 𝑓(Cycles‘𝐺)𝑝))
32imbi1d 344 . . 3 (𝑔 = 𝐺 → ((𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅) ↔ (𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅)))
432albidv 1958 . 2 (𝑔 = 𝐺 → (∀𝑓∀𝑝(𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅) ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅)))
5 dfacycgr1 30807 . 2 AcyclicGraph = {𝑔 ∣ ∀𝑓∀𝑝(𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅)}
64, 5elab2g 3637 1 (𝐺 ∈ 𝑊 → (𝐺 ∈ AcyclicGraph ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∅c0 4281   class class class wbr 5108  ‘cfv 6566  Cyclesccycls 30429  AcyclicGraphcacycgr 30805
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-acycgr 30806
This theorem is used by:  acycgrcycl  30810  acycgr1v  36112
  Copyright terms: Public domain W3C validator