| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r19.12 | Structured version Visualization version GIF version | ||
| Description: Restricted quantifier version of 19.12 2328. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.) Avoid ax-13 2372, ax-ext 2703. (Revised by Wolf Lammen, 17-Jun-2023.) (Proof shortened by Wolf Lammen, 4-Nov-2024.) |
| Ref | Expression |
|---|---|
| r19.12 | ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 3057 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝜑)) | |
| 2 | nfv 1915 | . . . . 5 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴 | |
| 3 | nfra1 3256 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝜑 | |
| 4 | 2, 3 | nfan 1900 | . . . 4 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝜑) |
| 5 | 4 | nfex 2325 | . . 3 ⊢ Ⅎ𝑦∃𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝜑) |
| 6 | 1, 5 | nfxfr 1854 | . 2 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 |
| 7 | rsp 3220 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐵 → 𝜑)) | |
| 8 | 7 | com12 32 | . . . 4 ⊢ (𝑦 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 𝜑 → 𝜑)) |
| 9 | 8 | reximdv 3147 | . . 3 ⊢ (𝑦 ∈ 𝐵 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∃𝑥 ∈ 𝐴 𝜑)) |
| 10 | 9 | com12 32 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝜑)) |
| 11 | 6, 10 | ralrimi 3230 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1780 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-10 2144 ax-11 2160 ax-12 2180 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-ral 3048 df-rex 3057 |
| This theorem is referenced by: iuniin 4952 ucncn 24199 ftc1a 25971 heicant 37705 rngoid 37952 rngmgmbs4 37981 intimass 43757 intimag 43759 |
| Copyright terms: Public domain | W3C validator |