Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > inex3 | Structured version Visualization version GIF version |
Description: Sufficient condition for the intersection relation to be a set. (Contributed by Peter Mazsa, 24-Nov-2019.) |
Ref | Expression |
---|---|
inex3 | ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 ∩ 𝐵) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inex1g 5215 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) | |
2 | inex2g 5216 | . 2 ⊢ (𝐵 ∈ 𝑊 → (𝐴 ∩ 𝐵) ∈ V) | |
3 | 1, 2 | jaoi 853 | 1 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 ∩ 𝐵) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 843 ∈ wcel 2110 Vcvv 3494 ∩ cin 3934 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-in 3942 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |