| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A way to define an operation class abstraction without using existential quantifiers. |
| Ref | Expression |
|---|---|
| dfoprab4.1 |
|
| Ref | Expression |
|---|---|
| dfoprab4 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfoprab4.1 |
. . 3
| |
| 2 | fveq2 3730 |
. . . 4
| |
| 3 | visset 1816 |
. . . . 5
| |
| 4 | 3 | op1st 4091 |
. . . 4
|
| 5 | 2, 4 | syl5eqr 1524 |
. . 3
|
| 6 | fveq2 3730 |
. . . 4
| |
| 7 | visset 1816 |
. . . . 5
| |
| 8 | 3, 7 | op2nd 4092 |
. . . 4
|
| 9 | 6, 8 | syl5eqr 1524 |
. . 3
|
| 10 | 1, 5, 9 | sylanc 473 |
. 2
|
| 11 | 10 | dfoprab5 4121 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-9 967 ax-10 968 ax-11 969 ax-12 970 ax-13 971 ax-14 972 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 ax-sep 2708 ax-nul 2715 ax-pow 2748 ax-pr 2785 ax-un 2872 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 779 df-ex 983 df-sb 1174 df-eu 1384 df-mo 1385 df-clab 1467 df-cleq 1472 df-clel 1475 df-ne 1590 df-ral 1652 df-rex 1653 df-v 1815 df-sbc 1945 df-csb 2005 df-dif 2052 df-un 2053 df-in 2054 df-ss 2056 df-nul 2284 df-pw 2406 df-sn 2416 df-pr 2417 df-op 2420 df-uni 2508 df-br 2625 df-opab 2672 df-id 2841 df-xp 3190 df-rel 3191 df-cnv 3192 df-co 3193 df-dm 3194 df-rn 3195 df-res 3196 df-ima 3197 df-fun 3198 df-fv 3204 df-oprab 3972 df-1st 4085 df-2nd 4086 |