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

Theorem iunpw 4237
Description: An indexed union of a power class in terms of the power class of the union of its index. Part of Exercise 24(b) of [Enderton] p. 33. (Contributed by NM, 29-Nov-2003.)
Hypothesis
Ref Expression
iunpw.1 𝐴 ∈ V
Assertion
Ref Expression
iunpw (∃𝑥𝐴 𝑥 = 𝐴 ↔ 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
Distinct variable group:   𝑥,𝐴

Proof of Theorem iunpw
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 sseq2 3022 . . . . . . . 8 (𝑥 = 𝐴 → (𝑦𝑥𝑦 𝐴))
21biimprcd 158 . . . . . . 7 (𝑦 𝐴 → (𝑥 = 𝐴𝑦𝑥))
32reximdv 2463 . . . . . 6 (𝑦 𝐴 → (∃𝑥𝐴 𝑥 = 𝐴 → ∃𝑥𝐴 𝑦𝑥))
43com12 30 . . . . 5 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 → ∃𝑥𝐴 𝑦𝑥))
5 ssiun 3728 . . . . . 6 (∃𝑥𝐴 𝑦𝑥𝑦 𝑥𝐴 𝑥)
6 uniiun 3739 . . . . . 6 𝐴 = 𝑥𝐴 𝑥
75, 6syl6sseqr 3047 . . . . 5 (∃𝑥𝐴 𝑦𝑥𝑦 𝐴)
84, 7impbid1 140 . . . 4 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥))
9 vex 2605 . . . . 5 𝑦 ∈ V
109elpw 3396 . . . 4 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
11 eliun 3690 . . . . 5 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥)
12 df-pw 3392 . . . . . . 7 𝒫 𝑥 = {𝑦𝑦𝑥}
1312abeq2i 2190 . . . . . 6 (𝑦 ∈ 𝒫 𝑥𝑦𝑥)
1413rexbii 2374 . . . . 5 (∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
1511, 14bitri 182 . . . 4 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
168, 10, 153bitr4g 221 . . 3 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 ∈ 𝒫 𝐴𝑦 𝑥𝐴 𝒫 𝑥))
1716eqrdv 2080 . 2 (∃𝑥𝐴 𝑥 = 𝐴 → 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
18 ssid 3019 . . . . 5 𝐴 𝐴
19 iunpw.1 . . . . . . . 8 𝐴 ∈ V
2019uniex 4200 . . . . . . 7 𝐴 ∈ V
2120elpw 3396 . . . . . 6 ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝐴)
22 eleq2 2143 . . . . . 6 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2321, 22syl5bbr 192 . . . . 5 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2418, 23mpbii 146 . . . 4 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 𝐴 𝑥𝐴 𝒫 𝑥)
25 eliun 3690 . . . 4 ( 𝐴 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
2624, 25sylib 120 . . 3 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
27 elssuni 3637 . . . . . . 7 (𝑥𝐴𝑥 𝐴)
28 elpwi 3399 . . . . . . 7 ( 𝐴 ∈ 𝒫 𝑥 𝐴𝑥)
2927, 28anim12i 331 . . . . . 6 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → (𝑥 𝐴 𝐴𝑥))
30 eqss 3015 . . . . . 6 (𝑥 = 𝐴 ↔ (𝑥 𝐴 𝐴𝑥))
3129, 30sylibr 132 . . . . 5 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → 𝑥 = 𝐴)
3231ex 113 . . . 4 (𝑥𝐴 → ( 𝐴 ∈ 𝒫 𝑥𝑥 = 𝐴))
3332reximia 2457 . . 3 (∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3426, 33syl 14 . 2 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3517, 34impbii 124 1 (∃𝑥𝐴 𝑥 = 𝐴 ↔ 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
Colors of variables: wff set class
Syntax hints:  wa 102  wb 103   = wceq 1285  wcel 1434  wrex 2350  Vcvv 2602  wss 2974  𝒫 cpw 3390   cuni 3609   ciun 3686
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-sep 3904  ax-un 4196
This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-v 2604  df-in 2980  df-ss 2987  df-pw 3392  df-uni 3610  df-iun 3688
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator