Proof of Theorem seqrval
| Step | Hyp | Ref
| Expression |
| 1 | | seqrval.1 |
. . 3
⊢ H =
{〈z, w〉∣w
= 〈((1st ‘z) + 1),
((2nd ‘z)S(F
‘((1st ‘z) +
1)))〉} |
| 2 | 1 | fveq1i 2833 |
. 2
⊢ (H
‘A) = ({〈z, w〉∣w
= 〈((1st ‘z) + 1),
((2nd ‘z)S(F
‘((1st ‘z) +
1)))〉} ‘A) |
| 3 | | seqrval.2 |
. . 3
⊢ A
∈ V |
| 4 | | opex 1893 |
. . 3
⊢ 〈((1st ‘A) + 1), ((2nd ‘A)S(F ‘((1st ‘A) + 1)))〉 ∈ V |
| 5 | | opeq12 1878 |
. . . 4
⊢ ((((1st ‘z) + 1) = ((1st ‘A) + 1) ∧ ((2nd ‘z)S(F ‘((1st ‘z) + 1))) = ((2nd ‘A)S(F ‘((1st ‘A) + 1)))) → 〈((1st
‘z) + 1), ((2nd
‘z)S(F
‘((1st ‘z) +
1)))〉 = 〈((1st ‘A) + 1), ((2nd ‘A)S(F ‘((1st ‘A) + 1)))〉) |
| 6 | | fveq2 2832 |
. . . . 5
⊢ (z =
A → (1st ‘z) = (1st ‘A)) |
| 7 | 6 | opreq1d 3012 |
. . . 4
⊢ (z =
A → ((1st ‘z) + 1) = ((1st ‘A) + 1)) |
| 8 | | fveq2 2832 |
. . . . 5
⊢ (z =
A → (2nd ‘z) = (2nd ‘A)) |
| 9 | 7 | fveq2d 2836 |
. . . . 5
⊢ (z =
A → (F ‘((1st ‘z) + 1)) = (F
‘((1st ‘A) +
1))) |
| 10 | 8, 9 | opreq12d 3014 |
. . . 4
⊢ (z =
A → ((2nd ‘z)S(F ‘((1st ‘z) + 1))) = ((2nd ‘A)S(F ‘((1st ‘A) + 1)))) |
| 11 | 5, 7, 10 | sylanc 361 |
. . 3
⊢ (z =
A → 〈((1st
‘z) + 1), ((2nd
‘z)S(F
‘((1st ‘z) +
1)))〉 = 〈((1st ‘A) + 1), ((2nd ‘A)S(F ‘((1st ‘A) + 1)))〉) |
| 12 | 3, 4, 11 | fvopab 2877 |
. 2
⊢ ({〈z, w〉∣w
= 〈((1st ‘z) + 1),
((2nd ‘z)S(F
‘((1st ‘z) +
1)))〉} ‘A) =
〈((1st ‘A) + 1),
((2nd ‘A)S(F
‘((1st ‘A) +
1)))〉 |
| 13 | 2, 12 | eqtr 1119 |
1
⊢ (H
‘A) = 〈((1st
‘A) + 1), ((2nd
‘A)S(F
‘((1st ‘A) +
1)))〉 |