![]() |
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 2691 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 1, 2 | syl 14 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-cleq 2186 df-clel 2189 df-nfc 2325 df-rex 2478 |
This theorem is referenced by: rexeqtrdv 2699 rexeqtrrdv 2701 rexeqbidv 2707 rexeqbidva 2709 fnunirn 5810 cbvexfo 5829 fival 7029 nninfwlpoimlemg 7234 nninfwlpoimlemginf 7235 nninfwlpoim 7237 genipv 7569 exfzdc 10307 zproddc 11722 infssuzex 12086 nninfdcex 12090 ennnfonelemrnh 12573 grppropd 13089 dvdsrpropdg 13643 znunit 14147 cnpfval 14363 plyval 14878 |
Copyright terms: Public domain | W3C validator |