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 2732 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
2 | vtoclgf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | issetf 2728 | . . 3 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
4 | vtoclgf.2 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
5 | vtoclgf.4 | . . . . 5 ⊢ 𝜑 | |
6 | vtoclgf.3 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
7 | 5, 6 | mpbii 147 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝜓) |
8 | 4, 7 | exlimi 1581 | . . 3 ⊢ (∃𝑥 𝑥 = 𝐴 → 𝜓) |
9 | 3, 8 | sylbi 120 | . 2 ⊢ (𝐴 ∈ V → 𝜓) |
10 | 1, 9 | syl 14 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1342 Ⅎwnf 1447 ∃wex 1479 ∈ wcel 2135 Ⅎwnfc 2293 Vcvv 2721 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-v 2723 |
This theorem is referenced by: vtoclg 2781 vtocl2gf 2783 vtocl3gf 2784 vtoclgaf 2786 ceqsexg 2849 elabgf 2863 mob 2903 opeliunxp2 4738 fvmptss2 5555 |
Copyright terms: Public domain | W3C validator |