| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule used to change bound variables in an ordered pair abstraction, using implicit substitution. |
| Ref | Expression |
|---|---|
| cbvopab.1 |
|
| cbvopab.2 |
|
| cbvopab.3 |
|
| cbvopab.4 |
|
| cbvopab.5 |
|
| Ref | Expression |
|---|---|
| cbvopab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 925 |
. . . . 5
| |
| 2 | cbvopab.1 |
. . . . 5
| |
| 3 | 1, 2 | hban 704 |
. . . 4
|
| 4 | ax-17 925 |
. . . . 5
| |
| 5 | cbvopab.2 |
. . . . 5
| |
| 6 | 4, 5 | hban 704 |
. . . 4
|
| 7 | ax-17 925 |
. . . . 5
| |
| 8 | cbvopab.3 |
. . . . 5
| |
| 9 | 7, 8 | hban 704 |
. . . 4
|
| 10 | ax-17 925 |
. . . . 5
| |
| 11 | cbvopab.4 |
. . . . 5
| |
| 12 | 10, 11 | hban 704 |
. . . 4
|
| 13 | opeq12 1878 |
. . . . . 6
| |
| 14 | 13 | cleq2d 1112 |
. . . . 5
|
| 15 | cbvopab.5 |
. . . . 5
| |
| 16 | 14, 15 | anbi12d 476 |
. . . 4
|
| 17 | 3, 6, 9, 12, 16 | cbvex2 975 |
. . 3
|
| 18 | 17 | biabi 1181 |
. 2
|
| 19 | df-opab 2098 |
. 2
| |
| 20 | df-opab 2098 |
. 2
| |
| 21 | 18, 19, 20 | 3eqtr4 1126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbvopabv 2105 fvopabgf 2874 fvopabnf 2875 |
| 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-un 1490 df-sn 1811 df-pr 1812 df-op 1815 df-opab 2098 |