![]() |
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 2474 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) | |
2 | r2alf.1 | . . . . . 6 ⊢ Ⅎ𝑦𝐴 | |
3 | 2 | nfcri 2326 | . . . . 5 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴 |
4 | 3 | 19.42 1699 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) |
5 | anass 401 | . . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) | |
6 | 5 | exbii 1616 | . . . 4 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ ∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝜑))) |
7 | df-rex 2474 | . . . . 5 ⊢ (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑)) | |
8 | 7 | anbi2i 457 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑦 ∈ 𝐵 ∧ 𝜑))) |
9 | 4, 6, 8 | 3bitr4i 212 | . . 3 ⊢ (∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) |
10 | 9 | exbii 1616 | . 2 ⊢ (∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦 ∈ 𝐵 𝜑)) |
11 | 1, 10 | bitr4i 187 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∃wex 1503 ∈ wcel 2160 Ⅎwnfc 2319 ∃wrex 2469 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2171 |
This theorem depends on definitions: df-bi 117 df-nf 1472 df-sb 1774 df-cleq 2182 df-clel 2185 df-nfc 2321 df-rex 2474 |
This theorem is referenced by: r2ex 2510 rexcomf 2652 |
Copyright terms: Public domain | W3C validator |