![]() |
Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > prclisacycgr | Structured version Visualization version GIF version |
Description: A proper class (representing a null graph, see vtxvalprc 29077) has the property of an acyclic graph (see also acycgr0v 35133). (Contributed by BTernaryTau, 11-Oct-2023.) (New usage is discouraged.) |
Ref | Expression |
---|---|
prclisacycgr.1 | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
prclisacycgr | ⊢ (¬ 𝐺 ∈ V → ¬ ∃𝑓∃𝑝(𝑓(Cycles‘𝐺)𝑝 ∧ 𝑓 ≠ ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prclisacycgr.1 | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | fvprc 6899 | . . 3 ⊢ (¬ 𝐺 ∈ V → (Vtx‘𝐺) = ∅) | |
3 | 1, 2 | eqtrid 2787 | . 2 ⊢ (¬ 𝐺 ∈ V → 𝑉 = ∅) |
4 | br0 5197 | . . . . . 6 ⊢ ¬ 𝑓∅𝑝 | |
5 | df-cycls 29820 | . . . . . . . . . 10 ⊢ Cycles = (𝑔 ∈ V ↦ {〈𝑓, 𝑝〉 ∣ (𝑓(Paths‘𝑔)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}) | |
6 | 5 | relmptopab 7683 | . . . . . . . . 9 ⊢ Rel (Cycles‘𝐺) |
7 | cycliswlk 29831 | . . . . . . . . . 10 ⊢ (𝑓(Cycles‘𝐺)𝑝 → 𝑓(Walks‘𝐺)𝑝) | |
8 | df-br 5149 | . . . . . . . . . 10 ⊢ (𝑓(Cycles‘𝐺)𝑝 ↔ 〈𝑓, 𝑝〉 ∈ (Cycles‘𝐺)) | |
9 | df-br 5149 | . . . . . . . . . 10 ⊢ (𝑓(Walks‘𝐺)𝑝 ↔ 〈𝑓, 𝑝〉 ∈ (Walks‘𝐺)) | |
10 | 7, 8, 9 | 3imtr3i 291 | . . . . . . . . 9 ⊢ (〈𝑓, 𝑝〉 ∈ (Cycles‘𝐺) → 〈𝑓, 𝑝〉 ∈ (Walks‘𝐺)) |
11 | 6, 10 | relssi 5800 | . . . . . . . 8 ⊢ (Cycles‘𝐺) ⊆ (Walks‘𝐺) |
12 | 1 | eqeq1i 2740 | . . . . . . . . 9 ⊢ (𝑉 = ∅ ↔ (Vtx‘𝐺) = ∅) |
13 | g0wlk0 29685 | . . . . . . . . 9 ⊢ ((Vtx‘𝐺) = ∅ → (Walks‘𝐺) = ∅) | |
14 | 12, 13 | sylbi 217 | . . . . . . . 8 ⊢ (𝑉 = ∅ → (Walks‘𝐺) = ∅) |
15 | 11, 14 | sseqtrid 4048 | . . . . . . 7 ⊢ (𝑉 = ∅ → (Cycles‘𝐺) ⊆ ∅) |
16 | ss0 4408 | . . . . . . 7 ⊢ ((Cycles‘𝐺) ⊆ ∅ → (Cycles‘𝐺) = ∅) | |
17 | breq 5150 | . . . . . . . 8 ⊢ ((Cycles‘𝐺) = ∅ → (𝑓(Cycles‘𝐺)𝑝 ↔ 𝑓∅𝑝)) | |
18 | 17 | notbid 318 | . . . . . . 7 ⊢ ((Cycles‘𝐺) = ∅ → (¬ 𝑓(Cycles‘𝐺)𝑝 ↔ ¬ 𝑓∅𝑝)) |
19 | 15, 16, 18 | 3syl 18 | . . . . . 6 ⊢ (𝑉 = ∅ → (¬ 𝑓(Cycles‘𝐺)𝑝 ↔ ¬ 𝑓∅𝑝)) |
20 | 4, 19 | mpbiri 258 | . . . . 5 ⊢ (𝑉 = ∅ → ¬ 𝑓(Cycles‘𝐺)𝑝) |
21 | 20 | intnanrd 489 | . . . 4 ⊢ (𝑉 = ∅ → ¬ (𝑓(Cycles‘𝐺)𝑝 ∧ 𝑓 ≠ ∅)) |
22 | 21 | nexdv 1934 | . . 3 ⊢ (𝑉 = ∅ → ¬ ∃𝑝(𝑓(Cycles‘𝐺)𝑝 ∧ 𝑓 ≠ ∅)) |
23 | 22 | nexdv 1934 | . 2 ⊢ (𝑉 = ∅ → ¬ ∃𝑓∃𝑝(𝑓(Cycles‘𝐺)𝑝 ∧ 𝑓 ≠ ∅)) |
24 | 3, 23 | syl 17 | 1 ⊢ (¬ 𝐺 ∈ V → ¬ ∃𝑓∃𝑝(𝑓(Cycles‘𝐺)𝑝 ∧ 𝑓 ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∃wex 1776 ∈ wcel 2106 ≠ wne 2938 Vcvv 3478 ⊆ wss 3963 ∅c0 4339 〈cop 4637 class class class wbr 5148 ‘cfv 6563 0cc0 11153 ♯chash 14366 Vtxcvtx 29028 Walkscwlks 29629 Pathscpths 29745 Cyclesccycls 29818 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-fzo 13692 df-hash 14367 df-word 14550 df-wlks 29632 df-trls 29725 df-pths 29749 df-cycls 29820 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |