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

Theorem uniixp 7817
Description: The union of an infinite Cartesian product is included in a Cartesian product. (Contributed by NM, 28-Sep-2006.) (Revised by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
uniixp X𝑥𝐴 𝐵 ⊆ (𝐴 × 𝑥𝐴 𝐵)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem uniixp
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ixpf 7816 . . . . 5 (𝑓X𝑥𝐴 𝐵𝑓:𝐴 𝑥𝐴 𝐵)
2 fssxp 5973 . . . . 5 (𝑓:𝐴 𝑥𝐴 𝐵𝑓 ⊆ (𝐴 × 𝑥𝐴 𝐵))
31, 2syl 17 . . . 4 (𝑓X𝑥𝐴 𝐵𝑓 ⊆ (𝐴 × 𝑥𝐴 𝐵))
4 selpw 4115 . . . 4 (𝑓 ∈ 𝒫 (𝐴 × 𝑥𝐴 𝐵) ↔ 𝑓 ⊆ (𝐴 × 𝑥𝐴 𝐵))
53, 4sylibr 223 . . 3 (𝑓X𝑥𝐴 𝐵𝑓 ∈ 𝒫 (𝐴 × 𝑥𝐴 𝐵))
65ssriv 3572 . 2 X𝑥𝐴 𝐵 ⊆ 𝒫 (𝐴 × 𝑥𝐴 𝐵)
7 sspwuni 4547 . 2 (X𝑥𝐴 𝐵 ⊆ 𝒫 (𝐴 × 𝑥𝐴 𝐵) ↔ X𝑥𝐴 𝐵 ⊆ (𝐴 × 𝑥𝐴 𝐵))
86, 7mpbi 219 1 X𝑥𝐴 𝐵 ⊆ (𝐴 × 𝑥𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wcel 1977  wss 3540  𝒫 cpw 4108   cuni 4372   ciun 4455   × cxp 5036  wf 5800  Xcixp 7794
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ixp 7795
This theorem is referenced by:  ixpexg  7818
  Copyright terms: Public domain W3C validator