ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpsspw GIF version

Theorem xpsspw 4736
Description: A cross product is included in the power of the power of the union of its arguments. (Contributed by NM, 13-Sep-2006.)
Assertion
Ref Expression
xpsspw (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴𝐵)

Proof of Theorem xpsspw
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxpi 4640 . . . 4 (𝑧 ∈ (𝐴 × 𝐵) → ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)))
2 vex 2740 . . . . . . . 8 𝑥 ∈ V
3 vex 2740 . . . . . . . 8 𝑦 ∈ V
42, 3dfop 3776 . . . . . . 7 𝑥, 𝑦⟩ = {{𝑥}, {𝑥, 𝑦}}
5 snssi 3736 . . . . . . . . . . . . 13 (𝑥𝐴 → {𝑥} ⊆ 𝐴)
6 ssun3 3300 . . . . . . . . . . . . 13 ({𝑥} ⊆ 𝐴 → {𝑥} ⊆ (𝐴𝐵))
75, 6syl 14 . . . . . . . . . . . 12 (𝑥𝐴 → {𝑥} ⊆ (𝐴𝐵))
87adantr 276 . . . . . . . . . . 11 ((𝑥𝐴𝑦𝐵) → {𝑥} ⊆ (𝐴𝐵))
9 sseq1 3178 . . . . . . . . . . 11 (𝑧 = {𝑥} → (𝑧 ⊆ (𝐴𝐵) ↔ {𝑥} ⊆ (𝐴𝐵)))
108, 9syl5ibrcom 157 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐵) → (𝑧 = {𝑥} → 𝑧 ⊆ (𝐴𝐵)))
11 df-pr 3599 . . . . . . . . . . . 12 {𝑥, 𝑦} = ({𝑥} ∪ {𝑦})
12 snssi 3736 . . . . . . . . . . . . . . 15 (𝑦𝐵 → {𝑦} ⊆ 𝐵)
13 ssun4 3301 . . . . . . . . . . . . . . 15 ({𝑦} ⊆ 𝐵 → {𝑦} ⊆ (𝐴𝐵))
1412, 13syl 14 . . . . . . . . . . . . . 14 (𝑦𝐵 → {𝑦} ⊆ (𝐴𝐵))
157, 14anim12i 338 . . . . . . . . . . . . 13 ((𝑥𝐴𝑦𝐵) → ({𝑥} ⊆ (𝐴𝐵) ∧ {𝑦} ⊆ (𝐴𝐵)))
16 unss 3309 . . . . . . . . . . . . 13 (({𝑥} ⊆ (𝐴𝐵) ∧ {𝑦} ⊆ (𝐴𝐵)) ↔ ({𝑥} ∪ {𝑦}) ⊆ (𝐴𝐵))
1715, 16sylib 122 . . . . . . . . . . . 12 ((𝑥𝐴𝑦𝐵) → ({𝑥} ∪ {𝑦}) ⊆ (𝐴𝐵))
1811, 17eqsstrid 3201 . . . . . . . . . . 11 ((𝑥𝐴𝑦𝐵) → {𝑥, 𝑦} ⊆ (𝐴𝐵))
19 sseq1 3178 . . . . . . . . . . 11 (𝑧 = {𝑥, 𝑦} → (𝑧 ⊆ (𝐴𝐵) ↔ {𝑥, 𝑦} ⊆ (𝐴𝐵)))
2018, 19syl5ibrcom 157 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐵) → (𝑧 = {𝑥, 𝑦} → 𝑧 ⊆ (𝐴𝐵)))
2110, 20jaod 717 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → ((𝑧 = {𝑥} ∨ 𝑧 = {𝑥, 𝑦}) → 𝑧 ⊆ (𝐴𝐵)))
22 vex 2740 . . . . . . . . . 10 𝑧 ∈ V
2322elpr 3613 . . . . . . . . 9 (𝑧 ∈ {{𝑥}, {𝑥, 𝑦}} ↔ (𝑧 = {𝑥} ∨ 𝑧 = {𝑥, 𝑦}))
2422elpw 3581 . . . . . . . . 9 (𝑧 ∈ 𝒫 (𝐴𝐵) ↔ 𝑧 ⊆ (𝐴𝐵))
2521, 23, 243imtr4g 205 . . . . . . . 8 ((𝑥𝐴𝑦𝐵) → (𝑧 ∈ {{𝑥}, {𝑥, 𝑦}} → 𝑧 ∈ 𝒫 (𝐴𝐵)))
2625ssrdv 3161 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → {{𝑥}, {𝑥, 𝑦}} ⊆ 𝒫 (𝐴𝐵))
274, 26eqsstrid 3201 . . . . . 6 ((𝑥𝐴𝑦𝐵) → ⟨𝑥, 𝑦⟩ ⊆ 𝒫 (𝐴𝐵))
28 sseq1 3178 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ⊆ 𝒫 (𝐴𝐵) ↔ ⟨𝑥, 𝑦⟩ ⊆ 𝒫 (𝐴𝐵)))
2928biimpar 297 . . . . . 6 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ⊆ 𝒫 (𝐴𝐵)) → 𝑧 ⊆ 𝒫 (𝐴𝐵))
3027, 29sylan2 286 . . . . 5 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)) → 𝑧 ⊆ 𝒫 (𝐴𝐵))
3130exlimivv 1896 . . . 4 (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐴𝑦𝐵)) → 𝑧 ⊆ 𝒫 (𝐴𝐵))
321, 31syl 14 . . 3 (𝑧 ∈ (𝐴 × 𝐵) → 𝑧 ⊆ 𝒫 (𝐴𝐵))
3322elpw 3581 . . 3 (𝑧 ∈ 𝒫 𝒫 (𝐴𝐵) ↔ 𝑧 ⊆ 𝒫 (𝐴𝐵))
3432, 33sylibr 134 . 2 (𝑧 ∈ (𝐴 × 𝐵) → 𝑧 ∈ 𝒫 𝒫 (𝐴𝐵))
3534ssriv 3159 1 (𝐴 × 𝐵) ⊆ 𝒫 𝒫 (𝐴𝐵)
Colors of variables: wff set class
Syntax hints:  wa 104  wo 708   = wceq 1353  wex 1492  wcel 2148  cun 3127  wss 3129  𝒫 cpw 3575  {csn 3592  {cpr 3593  cop 3595   × cxp 4622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-opab 4063  df-xp 4630
This theorem is referenced by:  unixpss  4737  xpexg  4738
  Copyright terms: Public domain W3C validator