Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > zfun | Unicode version |
Description: Axiom of Union expressed with the fewest number of different variables. (Contributed by NM, 14-Aug-2003.) |
Ref | Expression |
---|---|
zfun |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-un 4350 | . 2 | |
2 | elequ2 1691 | . . . . . . 7 | |
3 | elequ1 1690 | . . . . . . 7 | |
4 | 2, 3 | anbi12d 464 | . . . . . 6 |
5 | 4 | cbvexv 1890 | . . . . 5 |
6 | 5 | imbi1i 237 | . . . 4 |
7 | 6 | albii 1446 | . . 3 |
8 | 7 | exbii 1584 | . 2 |
9 | 1, 8 | mpbi 144 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wal 1329 wex 1468 |
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-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-un 4350 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: uniex2 4353 bj-uniex2 13103 |
Copyright terms: Public domain | W3C validator |