Theorem vtxval3sn 29500

Description: Degenerated case 3 for vertices: The set of vertices of a singleton containing a singleton containing a singleton is the innermost singleton. (Contributed by AV, 24-Sep-2020.) (Avoid depending on this detail.)

Hypothesis

Ref	Expression
vtxval3sn.a	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
vtxval3sn	⊢ (Vtx‘{{{𝐴}}}) = {𝐴}

Proof of Theorem vtxval3sn

Step	Hyp	Ref	Expression
1		vtxval3sn.a	. 2 ⊢ 𝐴 ∈ V
2	1	opid 4853	. . . 4 ⊢ ⟨𝐴, 𝐴⟩ = {{𝐴}}
3	2	eqcomi 2769	. . 3 ⊢ {{𝐴}} = ⟨𝐴, 𝐴⟩
4	3	sneqi 4595	. 2 ⊢ {{{𝐴}}} = {⟨𝐴, 𝐴⟩}
5	1, 4	vtxvalsnop 29498	1 ⊢ (Vtx‘{{{𝐴}}}) = {𝐴}

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  Vcvv 3450  {csn 4584  ⟨cop 4590  ‘cfv 6533  Vtxcvtx 29453

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736

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-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  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-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fv 6541  df-1st 7986  df-vtx 29455

This theorem is used by: (None)