![]() |
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 28801 | . . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺) = ∅)) | |
2 | 1 | biimpd 228 | . . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅)) |
3 | 2 | ex 412 | . . . 4 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅))) |
4 | 3 | pm2.43a 54 | . . 3 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (iEdg‘𝐺) = ∅)) |
5 | 4 | imp 406 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅) |
6 | 0vtxrusgr 29303 | . 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 395 = wceq 1533 ∈ wcel 2098 ∀wral 3053 ∅c0 4314 class class class wbr 5138 ‘cfv 6533 ℕ0*cxnn0 12541 Vtxcvtx 28725 iEdgciedg 28726 UHGraphcuhgr 28785 RegUSGraph crusgr 29282 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-i2m1 11174 ax-1ne0 11175 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-po 5578 df-so 5579 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7404 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-2 12272 df-uhgr 28787 df-upgr 28811 df-uspgr 28879 df-usgr 28880 df-rgr 29283 df-rusgr 29284 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |