New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > equvini | Unicode version |
Description: A variable introduction law for equality. Lemma 15 of [Monk2] p. 109, however we do not require to be distinct from and (making the proof longer). (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Ref | Expression |
---|---|
equvini |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equcomi 1679 | . . . . . 6 | |
2 | 1 | alimi 1559 | . . . . 5 |
3 | a9e 1951 | . . . . 5 | |
4 | 2, 3 | jctir 524 | . . . 4 |
5 | 4 | a1d 22 | . . 3 |
6 | 19.29 1596 | . . 3 | |
7 | 5, 6 | syl6 29 | . 2 |
8 | a9e 1951 | . . . . . 6 | |
9 | 1 | eximi 1576 | . . . . . 6 |
10 | 8, 9 | ax-mp 5 | . . . . 5 |
11 | 10 | 2a1i 24 | . . . 4 |
12 | 11 | anc2ri 541 | . . 3 |
13 | 19.29r 1597 | . . 3 | |
14 | 12, 13 | syl6 29 | . 2 |
15 | ioran 476 | . . 3 | |
16 | nfeqf 1958 | . . . 4 | |
17 | ax-8 1675 | . . . . . 6 | |
18 | 17 | anc2li 540 | . . . . 5 |
19 | 18 | equcoms 1681 | . . . 4 |
20 | 16, 19 | spimed 1977 | . . 3 |
21 | 15, 20 | sylbi 187 | . 2 |
22 | 7, 14, 21 | ecase3 907 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wo 357 wa 358 wal 1540 wex 1541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-tru 1319 df-ex 1542 df-nf 1545 |
This theorem is referenced by: equvin 2001 sbequi 2059 |
Copyright terms: Public domain | W3C validator |