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

Theorem djussxp 5795
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 4988 . 2 ( 𝑥𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V) ↔ ∀𝑥𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V))
2 snssi 4752 . . 3 (𝑥𝐴 → {𝑥} ⊆ 𝐴)
3 ssv 3947 . . 3 𝐵 ⊆ V
4 xpss12 5640 . . 3 (({𝑥} ⊆ 𝐴𝐵 ⊆ V) → ({𝑥} × 𝐵) ⊆ (𝐴 × V))
52, 3, 4sylancl 587 . 2 (𝑥𝐴 → ({𝑥} × 𝐵) ⊆ (𝐴 × V))
61, 5mprgbir 3059 1 𝑥𝐴 ({𝑥} × 𝐵) ⊆ (𝐴 × V)
Colors of variables: wff setvar class
Syntax hints:  wcel 2114  Vcvv 3430  wss 3890  {csn 4568   ciun 4934   × cxp 5623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-v 3432  df-ss 3907  df-sn 4569  df-iun 4936  df-opab 5149  df-xp 5631
This theorem is referenced by:  djudisj  6126  iundom2g  10456
  Copyright terms: Public domain W3C validator