MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  1vwmgr Structured version   Visualization version   GIF version

Theorem 1vwmgr 28640
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.)
Assertion
Ref Expression
1vwmgr ((𝐴𝑋𝑉 = {𝐴}) → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸))
Distinct variable groups:   𝐴,,𝑣,𝑤   ,𝐸   ,𝑉,𝑣,𝑤
Allowed substitution hints:   𝐸(𝑤,𝑣)   𝑋(𝑤,𝑣,)

Proof of Theorem 1vwmgr
StepHypRef Expression
1 ral0 4443 . . . 4 𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)
2 sneq 4571 . . . . . . . 8 ( = 𝐴 → {} = {𝐴})
32difeq2d 4057 . . . . . . 7 ( = 𝐴 → ({𝐴} ∖ {}) = ({𝐴} ∖ {𝐴}))
4 difid 4304 . . . . . . 7 ({𝐴} ∖ {𝐴}) = ∅
53, 4eqtrdi 2794 . . . . . 6 ( = 𝐴 → ({𝐴} ∖ {}) = ∅)
6 preq2 4670 . . . . . . . 8 ( = 𝐴 → {𝑣, } = {𝑣, 𝐴})
76eleq1d 2823 . . . . . . 7 ( = 𝐴 → ({𝑣, } ∈ 𝐸 ↔ {𝑣, 𝐴} ∈ 𝐸))
8 reueq1 3344 . . . . . . . 8 (({𝐴} ∖ {}) = ({𝐴} ∖ {𝐴}) → (∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
93, 8syl 17 . . . . . . 7 ( = 𝐴 → (∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
107, 9anbi12d 631 . . . . . 6 ( = 𝐴 → (({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
115, 10raleqbidv 3336 . . . . 5 ( = 𝐴 → (∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
1211rexsng 4610 . . . 4 (𝐴𝑋 → (∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
131, 12mpbiri 257 . . 3 (𝐴𝑋 → ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1413adantr 481 . 2 ((𝐴𝑋𝑉 = {𝐴}) → ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
15 difeq1 4050 . . . . 5 (𝑉 = {𝐴} → (𝑉 ∖ {}) = ({𝐴} ∖ {}))
16 reueq1 3344 . . . . . . 7 ((𝑉 ∖ {}) = ({𝐴} ∖ {}) → (∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1715, 16syl 17 . . . . . 6 (𝑉 = {𝐴} → (∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1817anbi2d 629 . . . . 5 (𝑉 = {𝐴} → (({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
1915, 18raleqbidv 3336 . . . 4 (𝑉 = {𝐴} → (∀𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2019rexeqbi1dv 3341 . . 3 (𝑉 = {𝐴} → (∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2120adantl 482 . 2 ((𝐴𝑋𝑉 = {𝐴}) → (∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2214, 21mpbird 256 1 ((𝐴𝑋𝑉 = {𝐴}) → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  wrex 3065  ∃!wreu 3066  cdif 3884  c0 4256  {csn 4561  {cpr 4563
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 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-nul 4257  df-sn 4562  df-pr 4564
This theorem is referenced by:  1to2vfriswmgr  28643
  Copyright terms: Public domain W3C validator