| 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 4188 |
. 2
| |
| 2 | elequ2 1641 |
. . . . . . 7
| |
| 3 | elequ1 1640 |
. . . . . . 7
| |
| 4 | 2, 3 | anbi12d 456 |
. . . . . 6
|
| 5 | 4 | cbvexv 1836 |
. . . . 5
|
| 6 | 5 | imbi1i 236 |
. . . 4
|
| 7 | 6 | albii 1399 |
. . 3
|
| 8 | 7 | exbii 1536 |
. 2
|
| 9 | 1, 8 | mpbi 143 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-un 4188 |
| This theorem depends on definitions: df-bi 115 |
| This theorem is referenced by: uniex2 4191 bj-uniex2 10707 |
| Copyright terms: Public domain | W3C validator |