| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frgr0vb | Structured version Visualization version GIF version | ||
| Description: Any null graph (without vertices and edges) is a friendship graph. (Contributed by Alexander van der Vekens, 30-Sep-2017.) (Revised by AV, 29-Mar-2021.) |
| Ref | Expression |
|---|---|
| frgr0vb | ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ FriendGraph ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgr0v 30353 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅) → (𝐺 ∈ FriendGraph ↔ (iEdg‘𝐺) = ∅)) | |
| 2 | 1 | biimp3ar 1474 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ FriendGraph ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1088 = wceq 1543 ∈ wcel 2115 ∅c0 4264 ‘cfv 6488 Vtxcvtx 29086 iEdgciedg 29087 FriendGraph cfrgr 30349 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1970 ax-7 2011 ax-8 2117 ax-9 2125 ax-10 2148 ax-11 2164 ax-12 2185 ax-ext 2708 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7681 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-i2m1 11100 ax-1ne0 11101 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 850 df-3or 1089 df-3an 1090 df-tru 1546 df-fal 1556 df-ex 1783 df-nf 1787 df-sb 2070 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3061 df-rmo 3341 df-reu 3342 df-rab 3389 df-v 3430 df-sbc 3727 df-csb 3835 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-2 12238 df-uhgr 29148 df-upgr 29172 df-uspgr 29240 df-usgr 29241 df-frgr 30350 |
| This theorem is referenced by: frgruhgr0v 30355 |
| Copyright terms: Public domain | W3C validator |