Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rexeqdv | Unicode 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 2661 | . 2 | |
3 | 1, 2 | syl 14 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1343 wrex 2444 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-cleq 2158 df-clel 2161 df-nfc 2296 df-rex 2449 |
This theorem is referenced by: rexeqbidv 2673 rexeqbidva 2675 fnunirn 5734 cbvexfo 5753 fival 6931 genipv 7446 exfzdc 10171 zproddc 11516 infssuzex 11878 nninfdcex 11882 ennnfonelemrnh 12345 cnpfval 12795 |
Copyright terms: Public domain | W3C validator |