Theorem inex2g 5283

Description: Sufficient condition for an intersection to be a set. Commuted form of inex1g 5282. (Contributed by Peter Mazsa, 19-Dec-2018.)

Assertion

Ref	Expression
inex2g	⊢ (𝐴 ∈ 𝑉 → (𝐵 ∩ 𝐴) ∈ V)

Proof of Theorem inex2g

Step	Hyp	Ref	Expression
1		incom 4155	. 2 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵)
2		inex1g 5282	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V)
3	1, 2	eqeltrid 2864	1 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∩ 𝐴) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Vcvv 3450   ∩ cin 3898

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  ax-sep 5251

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-in 3906

This theorem is used by:  ssexg  5284  dfac8b  10037  ac10ct  10040  satefvfmla1  36007  inex3  39089  inxpex  39090  dfcnvrefrels2  39359  dfcnvrefrels3  39360  iunrelexp0  44545