| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The Axiom of Regularity using abbreviations. This form with the intersection arguments commuted (compared to zfreg 3447) is formally more convenient for us in some cases. Axiom Reg of [BellMachover] p. 480. |
| Ref | Expression |
|---|---|
| zfreg2.1 |
|
| Ref | Expression |
|---|---|
| zfreg2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zfreg2.1 |
. . 3
| |
| 2 | 1 | zfregcl 3446 |
. 2
|
| 3 | n0 1714 |
. 2
| |
| 4 | incom 1636 |
. . . . 5
| |
| 5 | 4 | cleq1i 1108 |
. . . 4
|
| 6 | disj 1733 |
. . . 4
| |
| 7 | 5, 6 | bitr 151 |
. . 3
|
| 8 | 7 | birex 1224 |
. 2
|
| 9 | 2, 3, 8 | 3imtr4 192 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: zfregfr 3452 zfregs 3491 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 ax-reg 1078 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-v 1349 df-dif 1489 df-in 1491 df-nul 1708 |