| 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 2638. (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| 2rmorex | ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2896 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfre1 3259 | . . 3 ⊢ Ⅎ𝑦∃𝑦 ∈ 𝐵 𝜑 | |
| 3 | 1, 2 | nfrmow 3377 | . 2 ⊢ Ⅎ𝑦∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 |
| 4 | rmoim 3696 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑) → (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑)) | |
| 5 | rspe 3224 | . . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝜑) → ∃𝑦 ∈ 𝐵 𝜑) | |
| 6 | 5 | ex 412 | . . . 4 ⊢ (𝑦 ∈ 𝐵 → (𝜑 → ∃𝑦 ∈ 𝐵 𝜑)) |
| 7 | 6 | ralrimivw 3130 | . . 3 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 ∈ 𝐴 (𝜑 → ∃𝑦 ∈ 𝐵 𝜑)) |
| 8 | 4, 7 | syl11 33 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐵 → ∃*𝑥 ∈ 𝐴 𝜑)) |
| 9 | 3, 8 | ralrimi 3232 | 1 ⊢ (∃*𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐵 ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2113 ∀wral 3049 ∃wrex 3058 ∃*wrmo 3347 |
| 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-8 2115 ax-10 2146 ax-11 2162 ax-12 2182 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-mo 2537 df-clel 2809 df-nfc 2883 df-ral 3050 df-rex 3059 df-rmo 3348 |
| This theorem is referenced by: 2reu2 3846 |
| Copyright terms: Public domain | W3C validator |