Theorem inex3 38527

Description: Sufficient condition for the intersection relation to be a set. (Contributed by Peter Mazsa, 24-Nov-2019.)

Assertion

Ref	Expression
inex3	⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 ∩ 𝐵) ∈ V)

Proof of Theorem inex3

Step	Hyp	Ref	Expression
1		inex1g 5264	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V)
2		inex2g 5265	. 2 ⊢ (𝐵 ∈ 𝑊 → (𝐴 ∩ 𝐵) ∈ V)
3	1, 2	jaoi 857	1 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 ∩ 𝐵) ∈ V)

Syntax hints:   → wi 4   ∨ wo 847   ∈ wcel 2113  Vcvv 3440   ∩ cin 3900

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-in 3908

This theorem is referenced by: (None)