| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscrct | Structured version Visualization version GIF version | ||
| Description: Sufficient and necessary conditions for a pair of functions to be a circuit (in an undirected graph): A pair of function "is" (represents) a circuit iff it is a closed trail. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.) (Revised by AV, 30-Oct-2021.) |
| Ref | Expression |
|---|---|
| iscrct | ⊢ (𝐹(Circuits‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | crcts 30432 | . 2 ⊢ (Circuits‘𝐺) = {〈𝑓, 𝑝〉 ∣ (𝑓(Trails‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))} | |
| 2 | fveq1 6915 | . . . 4 ⊢ (𝑝 = 𝑃 → (𝑝‘0) = (𝑃‘0)) | |
| 3 | 2 | adantl 487 | . . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝑝‘0) = (𝑃‘0)) |
| 4 | simpr 490 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → 𝑝 = 𝑃) | |
| 5 | fveq2 6916 | . . . . 5 ⊢ (𝑓 = 𝐹 → (♯‘𝑓) = (♯‘𝐹)) | |
| 6 | 5 | adantr 486 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (♯‘𝑓) = (♯‘𝐹)) |
| 7 | 4, 6 | fveq12d 6923 | . . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝑝‘(♯‘𝑓)) = (𝑃‘(♯‘𝐹))) |
| 8 | 3, 7 | eqeq12d 2779 | . 2 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → ((𝑝‘0) = (𝑝‘(♯‘𝑓)) ↔ (𝑃‘0) = (𝑃‘(♯‘𝐹)))) |
| 9 | reltrls 30334 | . 2 ⊢ Rel (Trails‘𝐺) | |
| 10 | 1, 8, 9 | brfvopabrbr 7021 | 1 ⊢ (𝐹(Circuits‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 class class class wbr 5108 ‘cfv 6566 0cc0 11239 ♯chash 14515 Trailsctrls 30330 Circuitsccrcts 30428 |
| 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-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 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-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fv 6574 df-trls 30332 df-crcts 30430 |
| This theorem is used by: crctprop 30436 cycliscrct 30444 crctcsh 30470 0crct 30781 eupth2eucrct 30875 |
| Copyright terms: Public domain | W3C validator |