Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rusgrprop | Structured version Visualization version GIF version |
Description: The properties of a k-regular simple graph. (Contributed by Alexander van der Vekens, 8-Jul-2018.) (Revised by AV, 18-Dec-2020.) |
Ref | Expression |
---|---|
rusgrprop | ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rusgr 27618 | . . 3 ⊢ RegUSGraph = {〈𝑔, 𝑘〉 ∣ (𝑔 ∈ USGraph ∧ 𝑔 RegGraph 𝑘)} | |
2 | 1 | bropaex12 5628 | . 2 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ V ∧ 𝐾 ∈ V)) |
3 | isrusgr 27621 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝐺 RegUSGraph 𝐾 ↔ (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾))) | |
4 | 3 | biimpd 232 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝐾 ∈ V) → (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾))) |
5 | 2, 4 | mpcom 38 | 1 ⊢ (𝐺 RegUSGraph 𝐾 → (𝐺 ∈ USGraph ∧ 𝐺 RegGraph 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2110 Vcvv 3401 class class class wbr 5043 USGraphcusgr 27212 RegGraph crgr 27615 RegUSGraph crusgr 27616 |
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-ext 2706 ax-sep 5181 ax-nul 5188 ax-pr 5311 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2071 df-clab 2713 df-cleq 2726 df-clel 2812 df-ral 3059 df-rex 3060 df-rab 3063 df-v 3403 df-dif 3860 df-un 3862 df-nul 4228 df-if 4430 df-sn 4532 df-pr 4534 df-op 4538 df-br 5044 df-opab 5106 df-xp 5546 df-rusgr 27618 |
This theorem is referenced by: rusgrrgr 27623 rusgrusgr 27624 rusgrprop0 27627 |
Copyright terms: Public domain | W3C validator |