| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Union expressed with fewest number of different variables. |
| Ref | Expression |
|---|---|
| zfun |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-un 3790 |
. 2
| |
| 2 | elequ2 1497 |
. . . . . . 7
| |
| 3 | elequ1 1496 |
. . . . . . 7
| |
| 4 | 2, 3 | anbi12d 690 |
. . . . . 6
|
| 5 | 4 | cbvexv 1697 |
. . . . 5
|
| 6 | 5 | imbi1i 203 |
. . . 4
|
| 7 | 6 | albii 1346 |
. . 3
|
| 8 | 7 | exbii 1398 |
. 2
|
| 9 | 1, 8 | mpbi 206 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: uniex2 3793 axunndlem1 6099 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-12 1310 ax-13 1311 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-un 3790 |
| This theorem depends on definitions: df-bi 164 df-an 242 df-ex 1327 |