| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r2ex | GIF version | ||
| Description: Double restricted existential quantification. (Contributed by NM, 11-Nov-1995.) |
| Ref | Expression |
|---|---|
| r2ex | ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2219 | . 2 ⊢ Ⅎ𝑦𝐴 | |
| 2 | 1 | r2exf 2384 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 102 ↔ wb 103 ∃wex 1421 ∈ wcel 1433 ∃wrex 2349 |
| 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 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
| This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-cleq 2074 df-clel 2077 df-nfc 2208 df-rex 2354 |
| This theorem is referenced by: reean 2522 rexiunxp 4496 rnoprab2 5608 genprndl 6711 genprndu 6712 genpdisj 6713 prmuloc 6756 mullocpr 6761 axcnre 7047 |
| Copyright terms: Public domain | W3C validator |