![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > vtocl2 | GIF version |
Description: Implicit substitution of classes for setvar variables. (Contributed by NM, 26-Jul-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
vtocl2.1 | ⊢ 𝐴 ∈ V |
vtocl2.2 | ⊢ 𝐵 ∈ V |
vtocl2.3 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) |
vtocl2.4 | ⊢ 𝜑 |
Ref | Expression |
---|---|
vtocl2 | ⊢ 𝜓 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vtocl2.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
2 | 1 | isseti 2649 | . . . . 5 ⊢ ∃𝑥 𝑥 = 𝐴 |
3 | vtocl2.2 | . . . . . 6 ⊢ 𝐵 ∈ V | |
4 | 3 | isseti 2649 | . . . . 5 ⊢ ∃𝑦 𝑦 = 𝐵 |
5 | eeanv 1867 | . . . . . 6 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)) | |
6 | vtocl2.3 | . . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) | |
7 | 6 | biimpd 143 | . . . . . . 7 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 → 𝜓)) |
8 | 7 | 2eximi 1548 | . . . . . 6 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ∃𝑥∃𝑦(𝜑 → 𝜓)) |
9 | 5, 8 | sylbir 134 | . . . . 5 ⊢ ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵) → ∃𝑥∃𝑦(𝜑 → 𝜓)) |
10 | 2, 4, 9 | mp2an 420 | . . . 4 ⊢ ∃𝑥∃𝑦(𝜑 → 𝜓) |
11 | nfv 1476 | . . . . 5 ⊢ Ⅎ𝑦𝜓 | |
12 | 11 | 19.36-1 1619 | . . . 4 ⊢ (∃𝑦(𝜑 → 𝜓) → (∀𝑦𝜑 → 𝜓)) |
13 | 10, 12 | eximii 1549 | . . 3 ⊢ ∃𝑥(∀𝑦𝜑 → 𝜓) |
14 | 13 | 19.36aiv 1840 | . 2 ⊢ (∀𝑥∀𝑦𝜑 → 𝜓) |
15 | vtocl2.4 | . . 3 ⊢ 𝜑 | |
16 | 15 | ax-gen 1393 | . 2 ⊢ ∀𝑦𝜑 |
17 | 14, 16 | mpg 1395 | 1 ⊢ 𝜓 |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∀wal 1297 = wceq 1299 ∃wex 1436 ∈ wcel 1448 Vcvv 2641 |
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-5 1391 ax-7 1392 ax-gen 1393 ax-ie1 1437 ax-ie2 1438 ax-8 1450 ax-4 1455 ax-17 1474 ax-i9 1478 ax-ial 1482 ax-ext 2082 |
This theorem depends on definitions: df-bi 116 df-nf 1405 df-sb 1704 df-clab 2087 df-cleq 2093 df-clel 2096 df-v 2643 |
This theorem is referenced by: undifexmid 4057 caovord 5874 ctssexmid 6936 |
Copyright terms: Public domain | W3C validator |