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

Theorem 1vwmgr 30223
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 4493 . . . 4 𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)
2 sneq 4616 . . . . . . . 8 ( = 𝐴 → {} = {𝐴})
32difeq2d 4106 . . . . . . 7 ( = 𝐴 → ({𝐴} ∖ {}) = ({𝐴} ∖ {𝐴}))
4 difid 4356 . . . . . . 7 ({𝐴} ∖ {𝐴}) = ∅
53, 4eqtrdi 2785 . . . . . 6 ( = 𝐴 → ({𝐴} ∖ {}) = ∅)
6 preq2 4714 . . . . . . . 8 ( = 𝐴 → {𝑣, } = {𝑣, 𝐴})
76eleq1d 2818 . . . . . . 7 ( = 𝐴 → ({𝑣, } ∈ 𝐸 ↔ {𝑣, 𝐴} ∈ 𝐸))
8 reueq1 3400 . . . . . . . 8 (({𝐴} ∖ {}) = ({𝐴} ∖ {𝐴}) → (∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
93, 8syl 17 . . . . . . 7 ( = 𝐴 → (∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
107, 9anbi12d 632 . . . . . 6 ( = 𝐴 → (({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
115, 10raleqbidv 3329 . . . . 5 ( = 𝐴 → (∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
1211rexsng 4656 . . . 4 (𝐴𝑋 → (∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
131, 12mpbiri 258 . . 3 (𝐴𝑋 → ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1413adantr 480 . 2 ((𝐴𝑋𝑉 = {𝐴}) → ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
15 difeq1 4099 . . . . 5 (𝑉 = {𝐴} → (𝑉 ∖ {}) = ({𝐴} ∖ {}))
16 reueq1 3400 . . . . . . 7 ((𝑉 ∖ {}) = ({𝐴} ∖ {}) → (∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1715, 16syl 17 . . . . . 6 (𝑉 = {𝐴} → (∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸))
1817anbi2d 630 . . . . 5 (𝑉 = {𝐴} → (({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
1915, 18raleqbidv 3329 . . . 4 (𝑉 = {𝐴} → (∀𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2019rexeqbi1dv 3322 . . 3 (𝑉 = {𝐴} → (∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2120adantl 481 . 2 ((𝐴𝑋𝑉 = {𝐴}) → (∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {}){𝑣, 𝑤} ∈ 𝐸)))
2214, 21mpbird 257 1 ((𝐴𝑋𝑉 = {𝐴}) → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1539  wcel 2107  wral 3050  wrex 3059  ∃!wreu 3361  cdif 3928  c0 4313  {csn 4606  {cpr 4608
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3420  df-v 3465  df-dif 3934  df-un 3936  df-nul 4314  df-sn 4607  df-pr 4609
This theorem is referenced by:  1to2vfriswmgr  30226
  Copyright terms: Public domain W3C validator