Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1vwmgr | Structured version Visualization version Unicode version |
Description: Every graph with one vertex (which may be connect with itself by (multiple) loops!) is a windmill graph. (Contributed by Alexander van der Vekens, 5-Oct-2017.) (Revised by AV, 31-Mar-2021.) |
Ref | Expression |
---|---|
1vwmgr |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ral0 4076 | . . . 4 | |
2 | sneq 4187 | . . . . . . . 8 | |
3 | 2 | difeq2d 3728 | . . . . . . 7 |
4 | difid 3948 | . . . . . . 7 | |
5 | 3, 4 | syl6eq 2672 | . . . . . 6 |
6 | preq2 4269 | . . . . . . . 8 | |
7 | 6 | eleq1d 2686 | . . . . . . 7 |
8 | reueq1 3140 | . . . . . . . 8 | |
9 | 3, 8 | syl 17 | . . . . . . 7 |
10 | 7, 9 | anbi12d 747 | . . . . . 6 |
11 | 5, 10 | raleqbidv 3152 | . . . . 5 |
12 | 11 | rexsng 4219 | . . . 4 |
13 | 1, 12 | mpbiri 248 | . . 3 |
14 | 13 | adantr 481 | . 2 |
15 | difeq1 3721 | . . . . 5 | |
16 | reueq1 3140 | . . . . . . 7 | |
17 | 15, 16 | syl 17 | . . . . . 6 |
18 | 17 | anbi2d 740 | . . . . 5 |
19 | 15, 18 | raleqbidv 3152 | . . . 4 |
20 | 19 | rexeqbi1dv 3147 | . . 3 |
21 | 20 | adantl 482 | . 2 |
22 | 14, 21 | mpbird 247 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wceq 1483 wcel 1990 wral 2912 wrex 2913 wreu 2914 cdif 3571 c0 3915 csn 4177 cpr 4179 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-sn 4178 df-pr 4180 |
This theorem is referenced by: 1to2vfriswmgr 27143 |
Copyright terms: Public domain | W3C validator |