Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iineq1 | Unicode version |
Description: Equality theorem for restricted existential quantifier. (Contributed by NM, 27-Jun-1998.) |
Ref | Expression |
---|---|
iineq1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raleq 2603 | . . 3 | |
2 | 1 | abbidv 2235 | . 2 |
3 | df-iin 3786 | . 2 | |
4 | df-iin 3786 | . 2 | |
5 | 2, 3, 4 | 3eqtr4g 2175 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1316 wcel 1465 cab 2103 wral 2393 ciin 3784 |
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 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-iin 3786 |
This theorem is referenced by: riin0 3854 iin0r 4063 |
Copyright terms: Public domain | W3C validator |