Theorem cplgruvtxb 29874

Description: A graph 𝐺 is complete iff each vertex is a universal vertex. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 15-Feb-2022.)

Hypothesis

Ref	Expression
cplgruvtxb.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
cplgruvtxb	⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ComplGraph ↔ (UnivVtx‘𝐺) = 𝑉))

Proof of Theorem cplgruvtxb

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6879	. . 3 ⊢ (𝑔 = 𝐺 → (UnivVtx‘𝑔) = (UnivVtx‘𝐺))
2		fveq2 6879	. . . 4 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
3		cplgruvtxb.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
4	2, 3	eqtr4di 2813	. . 3 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
5	1, 4	eqeq12d 2776	. 2 ⊢ (𝑔 = 𝐺 → ((UnivVtx‘𝑔) = (Vtx‘𝑔) ↔ (UnivVtx‘𝐺) = 𝑉))
6		df-cplgr 29872	. 2 ⊢ ComplGraph = {𝑔 ∣ (UnivVtx‘𝑔) = (Vtx‘𝑔)}
7	5, 6	elab2g 3634	1 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ ComplGraph ↔ (UnivVtx‘𝐺) = 𝑉))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ‘cfv 6533  Vtxcvtx 29454  UnivVtxcuvtx 29846  ComplGraphccplgr 29870

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6489  df-fv 6541  df-cplgr 29872

This theorem is used by:  iscplgr  29876  cusgruvtxb  29883  nbcplgr  29895