| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isacycgr1 | Structured version Visualization version GIF version | ||
| Description: The property of being an acyclic graph. (Contributed by BTernaryTau, 11-Oct-2023.) |
| Ref | Expression |
|---|---|
| isacycgr1 | ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ AcyclicGraph ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6906 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Cycles‘𝑔) = (Cycles‘𝐺)) | |
| 2 | 1 | breqd 5154 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑓(Cycles‘𝑔)𝑝 ↔ 𝑓(Cycles‘𝐺)𝑝)) |
| 3 | 2 | imbi1d 341 | . . 3 ⊢ (𝑔 = 𝐺 → ((𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅) ↔ (𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅))) |
| 4 | 3 | 2albidv 1923 | . 2 ⊢ (𝑔 = 𝐺 → (∀𝑓∀𝑝(𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅) ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅))) |
| 5 | dfacycgr1 35149 | . 2 ⊢ AcyclicGraph = {𝑔 ∣ ∀𝑓∀𝑝(𝑓(Cycles‘𝑔)𝑝 → 𝑓 = ∅)} | |
| 6 | 4, 5 | elab2g 3680 | 1 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ AcyclicGraph ↔ ∀𝑓∀𝑝(𝑓(Cycles‘𝐺)𝑝 → 𝑓 = ∅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1538 = wceq 1540 ∈ wcel 2108 ∅c0 4333 class class class wbr 5143 ‘cfv 6561 Cyclesccycls 29805 AcyclicGraphcacycgr 35147 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-iota 6514 df-fv 6569 df-acycgr 35148 |
| This theorem is referenced by: acycgrcycl 35152 acycgr1v 35154 |
| Copyright terms: Public domain | W3C validator |