| New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > NFE Home > Th. List > sbc2or | Unicode version | ||
| Description: The disjunction of two
equivalences for class substitution does not
require a class existence hypothesis. This theorem tells us that there
are only 2 possibilities for |
| Ref | Expression |
|---|---|
| sbc2or |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsbcq2 3050 |
. . . 4
| |
| 2 | eqeq2 2362 |
. . . . . 6
| |
| 3 | 2 | anbi1d 685 |
. . . . 5
|
| 4 | 3 | exbidv 1626 |
. . . 4
|
| 5 | sb5 2100 |
. . . 4
| |
| 6 | 1, 4, 5 | vtoclbg 2916 |
. . 3
|
| 7 | 6 | orcd 381 |
. 2
|
| 8 | pm5.15 859 |
. . 3
| |
| 9 | vex 2863 |
. . . . . . . . . 10
| |
| 10 | eleq1 2413 |
. . . . . . . . . 10
| |
| 11 | 9, 10 | mpbii 202 |
. . . . . . . . 9
|
| 12 | 11 | adantr 451 |
. . . . . . . 8
|
| 13 | 12 | con3i 127 |
. . . . . . 7
|
| 14 | 13 | nexdv 1916 |
. . . . . 6
|
| 15 | 11 | con3i 127 |
. . . . . . . 8
|
| 16 | 15 | pm2.21d 98 |
. . . . . . 7
|
| 17 | 16 | alrimiv 1631 |
. . . . . 6
|
| 18 | 14, 17 | 2thd 231 |
. . . . 5
|
| 19 | 18 | bibi2d 309 |
. . . 4
|
| 20 | 19 | orbi2d 682 |
. . 3
|
| 21 | 8, 20 | mpbii 202 |
. 2
|
| 22 | 7, 21 | pm2.61i 156 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 |
| This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2479 df-v 2862 df-sbc 3048 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |