![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iunrab | GIF version |
Description: The indexed union of a restricted class abstraction. (Contributed by NM, 3-Jan-2004.) (Proof shortened by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
iunrab | ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunab 3732 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} | |
2 | df-rab 2358 | . . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} | |
3 | 2 | a1i 9 | . . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)}) |
4 | 3 | iuneq2i 3704 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜑)} |
5 | df-rab 2358 | . . 3 ⊢ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝐴 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝜑)} | |
6 | r19.42v 2512 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝜑)) | |
7 | 6 | abbii 2195 | . . 3 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝜑)} |
8 | 5, 7 | eqtr4i 2105 | . 2 ⊢ {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝐴 𝜑} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ 𝜑)} |
9 | 1, 4, 8 | 3eqtr4i 2112 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∃𝑥 ∈ 𝐴 𝜑} |
Colors of variables: wff set class |
Syntax hints: ∧ wa 102 = wceq 1285 ∈ wcel 1434 {cab 2068 ∃wrex 2350 {crab 2353 ∪ 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-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2064 |
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-rab 2358 df-v 2604 df-in 2980 df-ss 2987 df-iun 3688 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |