Theorem bj-snex 10704

Description: snex 3957 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)

Hypothesis

Ref	Expression
bj-snex.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
bj-snex	⊢ {𝐴} ∈ V

Proof of Theorem bj-snex

Step	Hyp	Ref	Expression
1		bj-snex.1	. 2 ⊢ 𝐴 ∈ V
2		bj-snexg 10703	. 2 ⊢ (𝐴 ∈ V → {𝐴} ∈ V)
3	1, 2	ax-mp 7	1 ⊢ {𝐴} ∈ V

Syntax hints:   ∈ wcel 1433  Vcvv 2601  {csn 3398

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-pr 3964  ax-bdor 10607  ax-bdeq 10611  ax-bdsep 10675

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405

This theorem is referenced by:  bj-d0clsepcl  10720