| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2rmorex | Structured version Visualization version GIF version | ||
| Description: Double restricted quantification with "at most one", analogous to 2moex 2674. (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| 2rmorex | ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2931 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfre1 3296 | . . 3 ⊢ Ⅎ𝑦∃𝑦 ∈ 𝐵 𝜑 | |
| 3 | 1, 2 | nfrmow 3405 | . 2 ⊢ Ⅎ𝑦∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 |
| 4 | rmoim 3712 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑) → (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑)) | |
| 5 | rspe 3261 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝜑) → ∃𝑦 ∈ 𝐵 𝜑) | |
| 6 | 5 | ex 417 | . . . 4 ⊢ (𝑦 ∈ 𝐵 → (𝜑 → ∃𝑦 ∈ 𝐵 𝜑)) |
| 7 | 6 | ralrimivw 3167 | . . 3 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑)) |
| 8 | 4, 7 | syl11 34 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝜑)) |
| 9 | 3, 8 | ralrimi 3269 | 1 ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2149 ∀wral 3085 ∃wrex 3095 ∃*wrmo 3375 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-10 2182 ax-11 2198 ax-12 2219 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-nf 1811 df-mo 2573 df-clel 2844 df-nfc 2918 df-ral 3086 df-rex 3096 df-rmo 3376 |
| This theorem is referenced by: 2reu2 3860 |
| Copyright terms: Public domain | W3C validator |