| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbcrex | GIF version | ||
| Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 15-Nov-2005.) (Revised by NM, 18-Aug-2018.) |
| Ref | Expression |
|---|---|
| sbcrex | ⊢ ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2339 | . 2 ⊢ Ⅎ𝑦𝐴 | |
| 2 | sbcrext 3067 | . 2 ⊢ (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 Ⅎwnfc 2326 ∃wrex 2476 [wsbc 2989 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-sbc 2990 |
| This theorem is referenced by: ac6sfi 6959 csbwrdg 10964 rexfiuz 11154 |
| Copyright terms: Public domain | W3C validator |