| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r2exf | GIF version | ||
| Description: Double restricted existential quantification. (Contributed by Mario Carneiro, 14-Oct-2016.) |
| Ref | Expression |
|---|---|
| r2alf.1 | ⊢ Ⅎ𝑦𝐴 |
| Ref | Expression |
|---|---|
| r2exf | ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 2481 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) | |
| 2 | r2alf.1 | . . . . . 6 ⊢ Ⅎ𝑦𝐴 | |
| 3 | 2 | nfcri 2333 | . . . . 5 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴 |
| 4 | 3 | 19.42 1702 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) |
| 5 | anass 401 | . . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) | |
| 6 | 5 | exbii 1619 | . . . 4 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ ∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) |
| 7 | df-rex 2481 | . . . . 5 ⊢ (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) | |
| 8 | 7 | anbi2i 457 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) |
| 9 | 4, 6, 8 | 3bitr4i 212 | . . 3 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) |
| 10 | 9 | exbii 1619 | . 2 ⊢ (∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) |
| 11 | 1, 10 | bitr4i 187 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∃wex 1506 ∈ wcel 2167 Ⅎwnfc 2326 ∃wrex 2476 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 df-sb 1777 df-cleq 2189 df-clel 2192 df-nfc 2328 df-rex 2481 |
| This theorem is referenced by: r2ex 2517 rexcomf 2659 |
| Copyright terms: Public domain | W3C validator |