![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rr19.28v | Structured version Visualization version GIF version |
Description: Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. We don't need the nonempty class condition of r19.28zv 4259 when there is an outer quantifier. (Contributed by NM, 29-Oct-2012.) |
Ref | Expression |
---|---|
rr19.28v | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 475 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜑) | |
2 | 1 | ralimi 3133 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜑) |
3 | biidd 254 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝜑 ↔ 𝜑)) | |
4 | 3 | rspcv 3493 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 𝜑 → 𝜑)) |
5 | 2, 4 | syl5 34 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → 𝜑)) |
6 | simpr 478 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜓) | |
7 | 6 | ralimi 3133 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜓) |
8 | 7 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜓)) |
9 | 5, 8 | jcad 509 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓))) |
10 | 9 | ralimia 3131 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
11 | r19.28v 3252 | . . 3 ⊢ ((𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) → ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓)) | |
12 | 11 | ralimi 3133 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓)) |
13 | 10, 12 | impbii 201 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 385 ∈ wcel 2157 ∀wral 3089 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-ext 2777 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ral 3094 df-v 3387 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |