Theorem bj-nvel 15697

Description: nvel 4176 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nvel	⊢ ¬ V ∈ 𝐴

Proof of Theorem bj-nvel

Step	Hyp	Ref	Expression
1		bj-vprc 15696	. 2 ⊢ ¬ V ∈ V
2		elex 2782	. 2 ⊢ (V ∈ 𝐴 → V ∈ V)
3	1, 2	mto 663	1 ⊢ ¬ V ∈ 𝐴

Syntax hints:  ¬ wn 3   ∈ wcel 2175  Vcvv 2771

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-5 1469  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-13 2177  ax-14 2178  ax-ext 2186  ax-bdn 15617  ax-bdel 15621  ax-bdsep 15684

This theorem depends on definitions:  df-bi 117  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-v 2773

This theorem is referenced by: (None)