Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > vtoclgf | GIF version |
Description: Implicit substitution of a class for a setvar variable, with bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Proof shortened by Mario Carneiro, 10-Oct-2016.) |
Ref | Expression |
---|---|
vtoclgf.1 | ⊢ Ⅎ𝑥𝐴 |
vtoclgf.2 | ⊢ Ⅎ𝑥𝜓 |
vtoclgf.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
vtoclgf.4 | ⊢ 𝜑 |
Ref | Expression |
---|---|
vtoclgf | ⊢ (𝐴 ∈ 𝑉 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2610 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
2 | vtoclgf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | issetf 2606 | . . 3 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
4 | vtoclgf.2 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
5 | vtoclgf.4 | . . . . 5 ⊢ 𝜑 | |
6 | vtoclgf.3 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
7 | 5, 6 | mpbii 146 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝜓) |
8 | 4, 7 | exlimi 1525 | . . 3 ⊢ (∃𝑥 𝑥 = 𝐴 → 𝜓) |
9 | 3, 8 | sylbi 119 | . 2 ⊢ (𝐴 ∈ V → 𝜓) |
10 | 1, 9 | syl 14 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 = wceq 1284 Ⅎwnf 1389 ∃wex 1421 ∈ wcel 1433 Ⅎwnfc 2206 Vcvv 2601 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 |
This theorem is referenced by: vtoclg 2658 vtocl2gf 2660 vtocl3gf 2661 vtoclgaf 2663 ceqsexg 2723 elabgf 2736 mob 2774 opeliunxp2 4494 fvmptss2 5268 |
Copyright terms: Public domain | W3C validator |