| 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 2384 | . 2 ⊢ Ⅎ𝑦𝐴 | |
| 2 | 1 | r2exf 2560 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∃wex 1541 ∈ wcel 2203 ∃wrex 2521 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1812 df-cleq 2225 df-clel 2228 df-nfc 2373 df-rex 2526 |
| This theorem is referenced by: reean 2712 rexiunxp 4896 rnoprab2 6136 genprndl 7832 genprndu 7833 genpdisj 7834 prmuloc 7877 mullocpr 7882 axcnre 8192 upgrex 16085 umgredg 16127 |
| Copyright terms: Public domain | W3C validator |