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

Theorem 1vwmgr 30904
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 4457 . . . 4 ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)
2 sneq 4594 . . . . . . . 8 (ℎ = 𝐴 → {ℎ} = {𝐴})
32difeq2d 4066 . . . . . . 7 (ℎ = 𝐴 → ({𝐴} ∖ {ℎ}) = ({𝐴} ∖ {𝐴}))
4 difid 4328 . . . . . . 7 ({𝐴} ∖ {𝐴}) = ∅
53, 4eqtrdi 2814 . . . . . 6 (ℎ = 𝐴 → ({𝐴} ∖ {ℎ}) = ∅)
6 preq2 4695 . . . . . . . 8 (ℎ = 𝐴 → {𝑣, ℎ} = {𝑣, 𝐴})
76eleq1d 2849 . . . . . . 7 (ℎ = 𝐴 → ({𝑣, ℎ} ∈ 𝐸 ↔ {𝑣, 𝐴} ∈ 𝐸))
8 reueq1 3401 . . . . . . . 8 (({𝐴} ∖ {ℎ}) = ({𝐴} ∖ {𝐴}) → (∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
93, 8syl 18 . . . . . . 7 (ℎ = 𝐴 → (∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸))
107, 9anbi12d 644 . . . . . 6 (ℎ = 𝐴 → (({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
115, 10raleqbidv 3338 . . . . 5 (ℎ = 𝐴 → (∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
1211rexsng 4637 . . . 4 (𝐴 ∈ 𝑋 → (∃ℎ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ∅ ({𝑣, 𝐴} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {𝐴}){𝑣, 𝑤} ∈ 𝐸)))
131, 12mpbiri 261 . . 3 (𝐴 ∈ 𝑋 → ∃ℎ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸))
1413adantr 486 . 2 ((𝐴 ∈ 𝑋 ∧ 𝑉 = {𝐴}) → ∃ℎ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸))
15 difeq1 4059 . . . . 5 (𝑉 = {𝐴} → (𝑉 ∖ {ℎ}) = ({𝐴} ∖ {ℎ}))
16 reueq1 3401 . . . . . . 7 ((𝑉 ∖ {ℎ}) = ({𝐴} ∖ {ℎ}) → (∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸))
1715, 16syl 18 . . . . . 6 (𝑉 = {𝐴} → (∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸 ↔ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸))
1817anbi2d 642 . . . . 5 (𝑉 = {𝐴} → (({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸)))
1915, 18raleqbidv 3338 . . . 4 (𝑉 = {𝐴} → (∀𝑣 ∈ (𝑉 ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸)))
2019rexeqbi1dv 3334 . . 3 (𝑉 = {𝐴} → (∃ℎ ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ℎ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸)))
2120adantl 487 . 2 ((𝐴 ∈ 𝑋 ∧ 𝑉 = {𝐴}) → (∃ℎ ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸) ↔ ∃ℎ ∈ {𝐴}∀𝑣 ∈ ({𝐴} ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ ({𝐴} ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸)))
2214, 21mpbird 260 1 ((𝐴 ∈ 𝑋 ∧ 𝑉 = {𝐴}) → ∃ℎ ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {ℎ})({𝑣, ℎ} ∈ 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {ℎ}){𝑣, 𝑤} ∈ 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∃!wreu 3367   ∖ cdif 4048  ∅c0 4281  {csn 4588  {cpr 4590
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-dif 4050  df-un 4154  df-nul 4282  df-sn 4589  df-pr 4591
This theorem is used by:  1to2vfriswmgr  30907
  Copyright terms: Public domain W3C validator