Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reu4 | Unicode version |
Description: Restricted uniqueness using implicit substitution. (Contributed by NM, 23-Nov-1994.) |
Ref | Expression |
---|---|
rmo4.1 |
Ref | Expression |
---|---|
reu4 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reu5 2522 | . 2 | |
2 | rmo4.1 | . . . 4 | |
3 | 2 | rmo4 2734 | . . 3 |
4 | 3 | anbi2i 430 | . 2 |
5 | 1, 4 | bitri 173 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wral 2306 wrex 2307 wreu 2308 wrmo 2309 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-cleq 2033 df-clel 2036 df-ral 2311 df-rex 2312 df-reu 2313 df-rmo 2314 |
This theorem is referenced by: reuind 2744 receuap 7650 cju 7913 |
Copyright terms: Public domain | W3C validator |