Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0uhgrrusgr | Structured version Visualization version GIF version |
Description: The null graph as hypergraph is a k-regular simple graph for every k. (Contributed by Alexander van der Vekens, 10-Jul-2018.) (Revised by AV, 26-Dec-2020.) |
Ref | Expression |
---|---|
0uhgrrusgr | ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegUSGraph 𝑘) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uhgr0vb 26857 | . . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺) = ∅)) | |
2 | 1 | biimpd 231 | . . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅)) |
3 | 2 | ex 415 | . . . 4 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅))) |
4 | 3 | pm2.43a 54 | . . 3 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (iEdg‘𝐺) = ∅)) |
5 | 4 | imp 409 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅) |
6 | 0vtxrusgr 27359 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegUSGraph 𝑘) | |
7 | 5, 6 | mpd3an3 1458 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegUSGraph 𝑘) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∅c0 4291 class class class wbr 5066 ‘cfv 6355 ℕ0*cxnn0 11968 Vtxcvtx 26781 iEdgciedg 26782 UHGraphcuhgr 26841 RegUSGraph crusgr 27338 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-i2m1 10605 ax-1ne0 10606 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-po 5474 df-so 5475 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-2 11701 df-uhgr 26843 df-upgr 26867 df-uspgr 26935 df-usgr 26936 df-rgr 27339 df-rusgr 27340 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |