Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rr19.28v | GIF version |
Description: Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. (Contributed by NM, 29-Oct-2012.) |
Ref | Expression |
---|---|
rr19.28v | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 102 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜑) | |
2 | 1 | ralimi 2384 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜑) |
3 | biidd 161 | . . . . . 6 ⊢ (𝑦 = 𝑥 → (𝜑 ↔ 𝜑)) | |
4 | 3 | rspcv 2652 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 𝜑 → 𝜑)) |
5 | 2, 4 | syl5 28 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → 𝜑)) |
6 | simpr 103 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜓) | |
7 | 6 | ralimi 2384 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜓) |
8 | 7 | a1i 9 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑦 ∈ 𝐴 𝜓)) |
9 | 5, 8 | jcad 291 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓))) |
10 | 9 | ralimia 2382 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
11 | r19.28av 2449 | . . 3 ⊢ ((𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) → ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓)) | |
12 | 11 | ralimi 2384 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓)) |
13 | 10, 12 | impbii 117 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 ∈ wcel 1393 ∀wral 2306 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-v 2559 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |