| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r2ex | Structured version Visualization version GIF version | ||
| Description: Double restricted existential quantification. (Contributed by NM, 11-Nov-1995.) Reduce dependencies on axioms. (Revised by Wolf Lammen, 10-Jan-2020.) |
| Ref | Expression |
|---|---|
| r2ex | ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r2al 3201 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ¬ 𝜑)) | |
| 2 | 1 | r2exlem 3154 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 209 ∧ wa 400 ∃wex 1809 ∈ wcel 2143 ∃wrex 3089 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-ral 3080 df-rex 3090 |
| This theorem is referenced by: r3ex 3204 reeanlem 3236 elxp2 5687 elinxp 6020 rnoprab2 7518 elrnmpores 7550 oeeu 8590 omxpenlem 9067 axcnre 11150 hash2prb 14511 hashle2prv 14517 pmtrrn2 19531 fsumvma 27358 umgredg 29469 fusgr2wsp2nb 30666 spanuni 31877 5oalem7 31993 3oalem3 31997 trsp2cyc 33424 fmla0xp 35856 elfuns 36386 ellines 36625 dalem20 40448 diblsmopel 41926 iunrelexpuztr 44428 sprssspr 48213 prprelb 48248 |
| Copyright terms: Public domain | W3C validator |