| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rexeqdv | GIF version | ||
| Description: Equality deduction for restricted existential quantifier. (Contributed by NM, 14-Jan-2007.) |
| Ref | Expression |
|---|---|
| raleq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| rexeqdv | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | raleq1d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | rexeq 2750 | . 2 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1402 ∃wrex 2529 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rex 2534 |
| This theorem is referenced by: rexeqtrdv 2758 rexeqtrrdv 2760 rexeqbidv 2766 rexeqbidva 2768 fnunirn 5967 cbvexfo 5986 fival 7298 nninfwlpoimlemg 7509 nninfwlpoimlemginf 7510 nninfwlpoim 7513 nninfinfwlpo 7514 genipv 7870 exfzdc 10642 infssuzex 10649 nninfdcex 10655 zproddc 12329 ennnfonelemrnh 13290 grppropd 13805 dvdsrpropdg 14437 znunit 14977 cnpfval 15279 plyval 15816 uhgrvtxedgiedgb 16367 wlkvtxedg 16587 |
| Copyright terms: Public domain | W3C validator |