| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Union expressed with fewest number of different variables. |
| Ref | Expression |
|---|---|
| axun |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-un 2922 |
. 2
| |
| 2 | elequ2 1179 |
. . . . . . 7
| |
| 3 | elequ1 1178 |
. . . . . . 7
| |
| 4 | 2, 3 | anbi12d 639 |
. . . . . 6
|
| 5 | 4 | cbvexv 1357 |
. . . . 5
|
| 6 | 5 | imbi1i 193 |
. . . 4
|
| 7 | 6 | albii 1040 |
. . 3
|
| 8 | 7 | exbii 1092 |
. 2
|
| 9 | 1, 8 | mpbi 196 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: uniex2 2925 axunndlem1 5012 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1003 ax-gen 1004 ax-8 1005 ax-12 1009 ax-13 1010 ax-14 1011 ax-17 1012 ax-4 1014 ax-5o 1016 ax-6o 1019 ax-9o 1164 ax-un 2922 |
| This theorem depends on definitions: df-bi 154 df-an 232 df-ex 1022 |