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

Theorem iunpw 4577
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 3251 . . . . . . . 8 (𝑥 = 𝐴 → (𝑦𝑥𝑦 𝐴))
21biimprcd 160 . . . . . . 7 (𝑦 𝐴 → (𝑥 = 𝐴𝑦𝑥))
32reximdv 2633 . . . . . 6 (𝑦 𝐴 → (∃𝑥𝐴 𝑥 = 𝐴 → ∃𝑥𝐴 𝑦𝑥))
43com12 30 . . . . 5 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 → ∃𝑥𝐴 𝑦𝑥))
5 ssiun 4012 . . . . . 6 (∃𝑥𝐴 𝑦𝑥𝑦 𝑥𝐴 𝑥)
6 uniiun 4024 . . . . . 6 𝐴 = 𝑥𝐴 𝑥
75, 6sseqtrrdi 3276 . . . . 5 (∃𝑥𝐴 𝑦𝑥𝑦 𝐴)
84, 7impbid1 142 . . . 4 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥))
9 vex 2805 . . . . 5 𝑦 ∈ V
109elpw 3658 . . . 4 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
11 eliun 3974 . . . . 5 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥)
12 df-pw 3654 . . . . . . 7 𝒫 𝑥 = {𝑦𝑦𝑥}
1312abeq2i 2342 . . . . . 6 (𝑦 ∈ 𝒫 𝑥𝑦𝑥)
1413rexbii 2539 . . . . 5 (∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
1511, 14bitri 184 . . . 4 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
168, 10, 153bitr4g 223 . . 3 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 ∈ 𝒫 𝐴𝑦 𝑥𝐴 𝒫 𝑥))
1716eqrdv 2229 . 2 (∃𝑥𝐴 𝑥 = 𝐴 → 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
18 ssid 3247 . . . . 5 𝐴 𝐴
19 iunpw.1 . . . . . . . 8 𝐴 ∈ V
2019uniex 4534 . . . . . . 7 𝐴 ∈ V
2120elpw 3658 . . . . . 6 ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝐴)
22 eleq2 2295 . . . . . 6 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2321, 22bitr3id 194 . . . . 5 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2418, 23mpbii 148 . . . 4 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 𝐴 𝑥𝐴 𝒫 𝑥)
25 eliun 3974 . . . 4 ( 𝐴 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
2624, 25sylib 122 . . 3 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
27 elssuni 3921 . . . . . . 7 (𝑥𝐴𝑥 𝐴)
28 elpwi 3661 . . . . . . 7 ( 𝐴 ∈ 𝒫 𝑥 𝐴𝑥)
2927, 28anim12i 338 . . . . . 6 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → (𝑥 𝐴 𝐴𝑥))
30 eqss 3242 . . . . . 6 (𝑥 = 𝐴 ↔ (𝑥 𝐴 𝐴𝑥))
3129, 30sylibr 134 . . . . 5 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → 𝑥 = 𝐴)
3231ex 115 . . . 4 (𝑥𝐴 → ( 𝐴 ∈ 𝒫 𝑥𝑥 = 𝐴))
3332reximia 2627 . . 3 (∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3426, 33syl 14 . 2 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3517, 34impbii 126 1 (∃𝑥𝐴 𝑥 = 𝐴 ↔ 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1397  wcel 2202  wrex 2511  Vcvv 2802  wss 3200  𝒫 cpw 3652   cuni 3893   ciun 3970
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-in 3206  df-ss 3213  df-pw 3654  df-uni 3894  df-iun 3972
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator