Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > inxpex | Structured version Visualization version GIF version |
Description: Sufficient condition for an intersection with a Cartesian product to be a set. (Contributed by Peter Mazsa, 10-May-2019.) |
Ref | Expression |
---|---|
inxpex | ⊢ ((𝑅 ∈ 𝑊 ∨ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inex1g 5216 | . 2 ⊢ (𝑅 ∈ 𝑊 → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V) | |
2 | xpexg 7467 | . . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → (𝐴 × 𝐵) ∈ V) | |
3 | inex2g 5217 | . . 3 ⊢ ((𝐴 × 𝐵) ∈ V → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V) | |
4 | 2, 3 | syl 17 | . 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V) |
5 | 1, 4 | jaoi 853 | 1 ⊢ ((𝑅 ∈ 𝑊 ∨ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∨ wo 843 ∈ wcel 2110 Vcvv 3495 ∩ cin 3935 × cxp 5548 |
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 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 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-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-opab 5122 df-xp 5556 df-rel 5557 |
This theorem is referenced by: xrninxpex 35636 |
Copyright terms: Public domain | W3C validator |