![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ceqsrex2v | GIF version |
Description: Elimination of a restricted existential quantifier, using implicit substitution. (Contributed by NM, 29-Oct-2005.) |
Ref | Expression |
---|---|
ceqsrex2v.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
ceqsrex2v.2 | ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
ceqsrex2v | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | anass 394 | . . . . . 6 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑))) | |
2 | 1 | rexbii 2396 | . . . . 5 ⊢ (∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑))) |
3 | r19.42v 2538 | . . . . 5 ⊢ (∃𝑦 ∈ 𝐷 (𝑥 = 𝐴 ∧ (𝑦 = 𝐵 ∧ 𝜑)) ↔ (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑))) | |
4 | 2, 3 | bitri 183 | . . . 4 ⊢ (∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑))) |
5 | 4 | rexbii 2396 | . . 3 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐶 (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑))) |
6 | ceqsrex2v.1 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
7 | 6 | anbi2d 453 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑦 = 𝐵 ∧ 𝜑) ↔ (𝑦 = 𝐵 ∧ 𝜓))) |
8 | 7 | rexbidv 2392 | . . . 4 ⊢ (𝑥 = 𝐴 → (∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓))) |
9 | 8 | ceqsrexv 2761 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (∃𝑥 ∈ 𝐶 (𝑥 = 𝐴 ∧ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜑)) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓))) |
10 | 5, 9 | syl5bb 191 | . 2 ⊢ (𝐴 ∈ 𝐶 → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓))) |
11 | ceqsrex2v.2 | . . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
12 | 11 | ceqsrexv 2761 | . 2 ⊢ (𝐵 ∈ 𝐷 → (∃𝑦 ∈ 𝐷 (𝑦 = 𝐵 ∧ 𝜓) ↔ 𝜒)) |
13 | 10, 12 | sylan9bb 451 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐷 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∧ 𝜑) ↔ 𝜒)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1296 ∈ wcel 1445 ∃wrex 2371 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-10 1448 ax-11 1449 ax-i12 1450 ax-bndl 1451 ax-4 1452 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 |
This theorem depends on definitions: df-bi 116 df-tru 1299 df-nf 1402 df-sb 1700 df-clab 2082 df-cleq 2088 df-clel 2091 df-nfc 2224 df-rex 2376 df-v 2635 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |