MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  djussxp Structured version   Visualization version   GIF version

Theorem djussxp 5833
Description: Disjoint union is a subset of a Cartesian product. (Contributed by Stefan O'Rear, 21-Nov-2014.)
Assertion
Ref Expression
djussxp ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem djussxp
StepHypRef Expression
1 iunss 5008 . 2 (∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V) ↔ ∀𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V))
2 snssi 4748 . . 3 (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴)
3 ssv 3937 . . 3 𝐵 ⊆ V
4 xpss12 5673 . . 3 (({𝑥} ⊆ 𝐴 ∧ 𝐵 ⊆ V) → ({𝑥} × 𝐵) ⊆ (𝐴 × V))
52, 3, 4sylancl 598 . 2 (𝑥 ∈ 𝐴 → ({𝑥} × 𝐵) ⊆ (𝐴 × V))
61, 5mprgbir 3087 1 ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  {csn 4588  ∪ ciun 4956   × cxp 5656
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-sn 4589  df-iun 4958  df-opab 5174  df-xp 5664
This theorem is used by:  djudisj  6176  iundom2g  10663
  Copyright terms: Public domain W3C validator