| 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 2732 | . 2 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∃wrex 2512 |
| 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 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rex 2517 |
| This theorem is referenced by: rexeqtrdv 2740 rexeqtrrdv 2742 rexeqbidv 2748 rexeqbidva 2750 fnunirn 5918 cbvexfo 5937 fival 7212 nninfwlpoimlemg 7417 nninfwlpoimlemginf 7418 nninfwlpoim 7421 nninfinfwlpo 7422 genipv 7772 exfzdc 10530 infssuzex 10537 nninfdcex 10541 zproddc 12201 ennnfonelemrnh 13098 grppropd 13661 dvdsrpropdg 14223 znunit 14735 cnpfval 14986 plyval 15523 uhgrvtxedgiedgb 16064 wlkvtxedg 16284 |
| Copyright terms: Public domain | W3C validator |