| 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 2246 | . 2 ⊢ (𝑥 = 𝐴 → (𝐸 = 𝐶 ↔ 𝐸 = 𝐷)) |
| 3 | 2 | rspcev 2923 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐸 = 𝐷) → ∃𝑥 ∈ 𝐵 𝐸 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ∃wrex 2523 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-rex 2528 df-v 2817 |
| This theorem is referenced by: elixpsn 6983 ixpsnf1o 6984 elfir 7273 0ct 7411 ctmlemr 7412 ctssdclemn0 7414 fodju0 7451 ccats1pfxeqrex 11432 mertenslemi1 12246 mertenslem2 12247 nninfctlemfo 12761 pcprmpw 13057 1arithlem4 13089 ctiunctlemfo 13274 elrestr 13544 lss1d 14657 lspsn 14690 znf1o 14925 restopnb 15172 mopnex 15496 metrest 15497 mpodvdsmulf1o 15984 lgsquadlem1 16076 2sqlem2 16114 mul2sq 16115 2sqlem3 16116 2sqlem9 16123 2sqlem10 16124 nnnninfex 16926 |
| Copyright terms: Public domain | W3C validator |