| 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 2866 |
. 2
| |
| 2 | elequ2 1137 |
. . . . . . 7
| |
| 3 | elequ1 1136 |
. . . . . . 7
| |
| 4 | 2, 3 | anbi12d 628 |
. . . . . 6
|
| 5 | 4 | cbvexv 1315 |
. . . . 5
|
| 6 | 5 | imbi1i 186 |
. . . 4
|
| 7 | 6 | albii 999 |
. . 3
|
| 8 | 7 | exbii 1051 |
. 2
|
| 9 | 1, 8 | mpbi 189 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: uniex2 2869 axunndlem1 4947 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-12 968 ax-13 969 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-un 2866 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 |