| 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 3177. (Contributed by Mario Carneiro, 14-Oct-2016.) Use r2exlem 3129. (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 3261 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ¬ 𝜑 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ¬ 𝜑)) |
| 3 | 2 | r2exlem 3129 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 207 ∧ wa 396 ∃wex 1786 ∈ wcel 2119 Ⅎwnfc 2887 ∃wrex 3064 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-12 2189 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-nf 1791 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 |
| This theorem is referenced by: rexcomf 3279 |
| Copyright terms: Public domain | W3C validator |