| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r2exf | Structured version Visualization version GIF version | ||
| Description: Double restricted existential quantification. For a version based on fewer axioms see r2ex 3198. (Contributed by Mario Carneiro, 14-Oct-2016.) Use r2exlem 3150. (Revised by Wolf Lammen, 10-Jan-2020.) |
| Ref | Expression |
|---|---|
| r2exf.1 | ⊢ Ⅎ𝑦𝐴 |
| Ref | Expression |
|---|---|
| r2exf | ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r2exf.1 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 2 | 1 | r2alf 3282 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ¬ 𝜑)) |
| 3 | 2 | r2exlem 3150 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 399 ∃wex 1798 ∈ wcel 2141 Ⅎwnfc 2908 ∃wrex 3085 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-12 2211 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-nf 1803 df-clel 2836 df-nfc 2910 df-ral 3076 df-rex 3086 |
| This theorem is referenced by: rexcomf 3300 |
| Copyright terms: Public domain | W3C validator |