| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djussxp | Structured version Visualization version GIF version | ||
| Description: Disjoint union is a subset of a Cartesian product. (Contributed by Stefan O'Rear, 21-Nov-2014.) |
| Ref | Expression |
|---|---|
| djussxp | ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iunss 5005 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V) ↔ ∀𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V)) | |
| 2 | snssi 4745 | . . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 3 | ssv 3936 | . . 3 ⊢ 𝐵 ⊆ V | |
| 4 | xpss12 5669 | . . 3 ⊢ (({𝑥} ⊆ 𝐴 ∧ 𝐵 ⊆ V) → ({𝑥} × 𝐵) ⊆ (𝐴 × V)) | |
| 5 | 2, 3, 4 | sylancl 598 | . 2 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} × 𝐵) ⊆ (𝐴 × V)) |
| 6 | 1, 5 | mprgbir 3086 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2146 Vcvv 3453 ⊆ wss 3899 {csn 4587 ∪ ciun 4953 × cxp 5652 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-11 2196 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-v 3455 df-ss 3900 df-sn 4588 df-iun 4955 df-opab 5170 df-xp 5660 |
| This theorem is used by: djudisj 6163 iundom2g 10634 |
| Copyright terms: Public domain | W3C validator |