| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspceeqv | GIF version | ||
| Description: Restricted existential specialization in an equality, using implicit substitution. (Contributed by BJ, 2-Sep-2022.) |
| Ref | Expression |
|---|---|
| rspceeqv.1 | ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷) |
| Ref | Expression |
|---|---|
| rspceeqv | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐸 = 𝐷) → ∃𝑥 ∈ 𝐵 𝐸 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspceeqv.1 | . . 3 ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷) | |
| 2 | 1 | eqeq2d 2241 | . 2 ⊢ (𝑥 = 𝐴 → (𝐸 = 𝐶 ↔ 𝐸 = 𝐷)) |
| 3 | 2 | rspcev 2907 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐸 = 𝐷) → ∃𝑥 ∈ 𝐵 𝐸 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∃wrex 2509 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-rex 2514 df-v 2801 |
| This theorem is referenced by: elixpsn 6890 ixpsnf1o 6891 elfir 7151 0ct 7285 ctmlemr 7286 ctssdclemn0 7288 fodju0 7325 ccats1pfxeqrex 11262 mertenslemi1 12061 mertenslem2 12062 nninfctlemfo 12576 pcprmpw 12872 1arithlem4 12904 ctiunctlemfo 13025 elrestr 13295 lss1d 14362 lspsn 14395 znf1o 14630 restopnb 14870 mopnex 15194 metrest 15195 mpodvdsmulf1o 15679 lgsquadlem1 15771 2sqlem2 15809 mul2sq 15810 2sqlem3 15811 2sqlem9 15818 2sqlem10 15819 nnnninfex 16448 |
| Copyright terms: Public domain | W3C validator |