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 27160 | . . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺) = ∅)) | |
2 | 1 | biimpd 232 | . . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅)) |
3 | 2 | ex 416 | . . . 4 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (𝐺 ∈ UHGraph → (iEdg‘𝐺) = ∅))) |
4 | 3 | pm2.43a 54 | . . 3 ⊢ (𝐺 ∈ UHGraph → ((Vtx‘𝐺) = ∅ → (iEdg‘𝐺) = ∅)) |
5 | 4 | imp 410 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → (iEdg‘𝐺) = ∅) |
6 | 0vtxrusgr 27662 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegUSGraph 𝑘) | |
7 | 5, 6 | mpd3an3 1464 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ (Vtx‘𝐺) = ∅) → ∀𝑘 ∈ ℕ0* 𝐺 RegUSGraph 𝑘) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 ∀wral 3058 ∅c0 4234 class class class wbr 5050 ‘cfv 6377 ℕ0*cxnn0 12159 Vtxcvtx 27084 iEdgciedg 27085 UHGraphcuhgr 27144 RegUSGraph crusgr 27641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5189 ax-nul 5196 ax-pow 5255 ax-pr 5319 ax-un 7520 ax-resscn 10783 ax-1cn 10784 ax-icn 10785 ax-addcl 10786 ax-addrcl 10787 ax-mulcl 10788 ax-mulrcl 10789 ax-i2m1 10794 ax-1ne0 10795 ax-rrecex 10798 ax-cnre 10799 ax-pre-lttri 10800 ax-pre-lttrn 10801 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2940 df-nel 3044 df-ral 3063 df-rex 3064 df-rab 3067 df-v 3407 df-sbc 3692 df-csb 3809 df-dif 3866 df-un 3868 df-in 3870 df-ss 3880 df-nul 4235 df-if 4437 df-pw 4512 df-sn 4539 df-pr 4541 df-op 4545 df-uni 4817 df-br 5051 df-opab 5113 df-mpt 5133 df-id 5452 df-po 5465 df-so 5466 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6335 df-fun 6379 df-fn 6380 df-f 6381 df-f1 6382 df-fo 6383 df-f1o 6384 df-fv 6385 df-ov 7213 df-er 8388 df-en 8624 df-dom 8625 df-sdom 8626 df-pnf 10866 df-mnf 10867 df-xr 10868 df-ltxr 10869 df-le 10870 df-2 11890 df-uhgr 27146 df-upgr 27170 df-uspgr 27238 df-usgr 27239 df-rgr 27642 df-rusgr 27643 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |