Theorem bj-intnexr 13278

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

Assertion

Ref	Expression
bj-intnexr	⊢ (∩ 𝐴 = V → ¬ ∩ 𝐴 ∈ V)

Proof of Theorem bj-intnexr

Step	Hyp	Ref	Expression
1		bj-vprc 13265	. 2 ⊢ ¬ V ∈ V
2		eleq1 2203	. 2 ⊢ (∩ 𝐴 = V → (∩ 𝐴 ∈ V ↔ V ∈ V))
3	1, 2	mtbiri 665	1 ⊢ (∩ 𝐴 = V → ¬ ∩ 𝐴 ∈ V)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1332   ∈ wcel 1481  Vcvv 2689  ∩ cint 3779

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-ext 2122  ax-bdn 13186  ax-bdel 13190  ax-bdsep 13253

This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-v 2691

This theorem is referenced by: (None)