| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The disjunction of two equivalences for class substitution does not require a class existence hypothesis. |
| Ref | Expression |
|---|---|
| sbc2or |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbc5g 1450 |
. . 3
| |
| 2 | orc 225 |
. . 3
| |
| 3 | 1, 2 | syl 12 |
. 2
|
| 4 | exmid 494 |
. . . 4
| |
| 5 | pm5.18 497 |
. . . . . 6
| |
| 6 | 5 | bicon2i 194 |
. . . . 5
|
| 7 | 6 | orbi2i 214 |
. . . 4
|
| 8 | 4, 7 | mpbir 165 |
. . 3
|
| 9 | pm5.1 501 |
. . . . . 6
| |
| 10 | visset 1350 |
. . . . . . . . . 10
| |
| 11 | eleq1 1149 |
. . . . . . . . . 10
| |
| 12 | 10, 11 | mpbii 168 |
. . . . . . . . 9
|
| 13 | 12 | adantr 306 |
. . . . . . . 8
|
| 14 | 13 | con3i 90 |
. . . . . . 7
|
| 15 | 14 | nexdv 983 |
. . . . . 6
|
| 16 | 12 | con3i 90 |
. . . . . . . 8
|
| 17 | 16 | pm2.21d 74 |
. . . . . . 7
|
| 18 | 17 | 19.21aiv 943 |
. . . . . 6
|
| 19 | 9, 15, 18 | sylanc 361 |
. . . . 5
|
| 20 | 19 | bibi2d 470 |
. . . 4
|
| 21 | 20 | orbi2d 466 |
. . 3
|
| 22 | 8, 21 | mpbii 168 |
. 2
|
| 23 | 3, 22 | pm2.61i 110 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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 |
| 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-v 1349 df-sbc 1441 |