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

Theorem iunpw 4211
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 2967 . . . . . . . 8 (𝑥 = 𝐴 → (𝑦𝑥𝑦 𝐴))
21biimprcd 149 . . . . . . 7 (𝑦 𝐴 → (𝑥 = 𝐴𝑦𝑥))
32reximdv 2420 . . . . . 6 (𝑦 𝐴 → (∃𝑥𝐴 𝑥 = 𝐴 → ∃𝑥𝐴 𝑦𝑥))
43com12 27 . . . . 5 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 → ∃𝑥𝐴 𝑦𝑥))
5 ssiun 3699 . . . . . 6 (∃𝑥𝐴 𝑦𝑥𝑦 𝑥𝐴 𝑥)
6 uniiun 3710 . . . . . 6 𝐴 = 𝑥𝐴 𝑥
75, 6syl6sseqr 2992 . . . . 5 (∃𝑥𝐴 𝑦𝑥𝑦 𝐴)
84, 7impbid1 130 . . . 4 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 𝐴 ↔ ∃𝑥𝐴 𝑦𝑥))
9 vex 2560 . . . . 5 𝑦 ∈ V
109elpw 3365 . . . 4 (𝑦 ∈ 𝒫 𝐴𝑦 𝐴)
11 eliun 3661 . . . . 5 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥)
12 df-pw 3361 . . . . . . 7 𝒫 𝑥 = {𝑦𝑦𝑥}
1312abeq2i 2148 . . . . . 6 (𝑦 ∈ 𝒫 𝑥𝑦𝑥)
1413rexbii 2331 . . . . 5 (∃𝑥𝐴 𝑦 ∈ 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
1511, 14bitri 173 . . . 4 (𝑦 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝑦𝑥)
168, 10, 153bitr4g 212 . . 3 (∃𝑥𝐴 𝑥 = 𝐴 → (𝑦 ∈ 𝒫 𝐴𝑦 𝑥𝐴 𝒫 𝑥))
1716eqrdv 2038 . 2 (∃𝑥𝐴 𝑥 = 𝐴 → 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
18 ssid 2964 . . . . 5 𝐴 𝐴
19 iunpw.1 . . . . . . . 8 𝐴 ∈ V
2019uniex 4174 . . . . . . 7 𝐴 ∈ V
2120elpw 3365 . . . . . 6 ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝐴)
22 eleq2 2101 . . . . . 6 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 ∈ 𝒫 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2321, 22syl5bbr 183 . . . . 5 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ( 𝐴 𝐴 𝐴 𝑥𝐴 𝒫 𝑥))
2418, 23mpbii 136 . . . 4 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 𝐴 𝑥𝐴 𝒫 𝑥)
25 eliun 3661 . . . 4 ( 𝐴 𝑥𝐴 𝒫 𝑥 ↔ ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
2624, 25sylib 127 . . 3 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥)
27 elssuni 3608 . . . . . . 7 (𝑥𝐴𝑥 𝐴)
28 elpwi 3368 . . . . . . 7 ( 𝐴 ∈ 𝒫 𝑥 𝐴𝑥)
2927, 28anim12i 321 . . . . . 6 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → (𝑥 𝐴 𝐴𝑥))
30 eqss 2960 . . . . . 6 (𝑥 = 𝐴 ↔ (𝑥 𝐴 𝐴𝑥))
3129, 30sylibr 137 . . . . 5 ((𝑥𝐴 𝐴 ∈ 𝒫 𝑥) → 𝑥 = 𝐴)
3231ex 108 . . . 4 (𝑥𝐴 → ( 𝐴 ∈ 𝒫 𝑥𝑥 = 𝐴))
3332reximia 2414 . . 3 (∃𝑥𝐴 𝐴 ∈ 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3426, 33syl 14 . 2 (𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥 → ∃𝑥𝐴 𝑥 = 𝐴)
3517, 34impbii 117 1 (∃𝑥𝐴 𝑥 = 𝐴 ↔ 𝒫 𝐴 = 𝑥𝐴 𝒫 𝑥)
Colors of variables: wff set class
Syntax hints:  wa 97  wb 98   = wceq 1243  wcel 1393  wrex 2307  Vcvv 2557  wss 2917  𝒫 cpw 3359   cuni 3580   ciun 3657
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-in 2924  df-ss 2931  df-pw 3361  df-uni 3581  df-iun 3659
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator