| 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 6880 ixpsnf1o 6881 elfir 7136 0ct 7270 ctmlemr 7271 ctssdclemn0 7273 fodju0 7310 ccats1pfxeqrex 11242 mertenslemi1 12041 mertenslem2 12042 nninfctlemfo 12556 pcprmpw 12852 1arithlem4 12884 ctiunctlemfo 13005 elrestr 13275 lss1d 14341 lspsn 14374 znf1o 14609 restopnb 14849 mopnex 15173 metrest 15174 mpodvdsmulf1o 15658 lgsquadlem1 15750 2sqlem2 15788 mul2sq 15789 2sqlem3 15790 2sqlem9 15797 2sqlem10 15798 nnnninfex 16347 |
| Copyright terms: Public domain | W3C validator |