| 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 4480 |
. 2
| |
| 2 | elequ2 2181 |
. . . . . . 7
| |
| 3 | elequ1 2180 |
. . . . . . 7
| |
| 4 | 2, 3 | anbi12d 473 |
. . . . . 6
|
| 5 | 4 | cbvexv 1942 |
. . . . 5
|
| 6 | 5 | imbi1i 238 |
. . . 4
|
| 7 | 6 | albii 1493 |
. . 3
|
| 8 | 7 | exbii 1628 |
. 2
|
| 9 | 1, 8 | mpbi 145 |
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-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-13 2178 ax-14 2179 ax-un 4480 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: uniex2 4483 bj-uniex2 15852 |
| Copyright terms: Public domain | W3C validator |