| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > seqeq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the sequence builder operation. (Contributed by Mario Carneiro, 4-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqeq2 | ⊢ ( + = 𝑄 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq 7456 | . . . . . 6 ⊢ ( + = 𝑄 → (𝑦 + (𝐹‘(𝑥 + 1))) = (𝑦𝑄(𝐹‘(𝑥 + 1)))) | |
| 2 | 1 | opeq2d 4851 | . . . . 5 ⊢ ( + = 𝑄 → 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉 = 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉) |
| 3 | 2 | mpoeq3dv 7529 | . . . 4 ⊢ ( + = 𝑄 → (𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉) = (𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉)) |
| 4 | rdgeq1 8456 | . . . 4 ⊢ ((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉) = (𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉) → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉)) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ ( + = 𝑄 → rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉)) |
| 6 | 5 | imaeq1d 6068 | . 2 ⊢ ( + = 𝑄 → (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω)) |
| 7 | df-seq 14184 | . 2 ⊢ seq𝑀( + , 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 8 | df-seq 14184 | . 2 ⊢ seq𝑀(𝑄, 𝐹) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) “ ω) | |
| 9 | 6, 7, 8 | 3eqtr4g 2826 | 1 ⊢ ( + = 𝑄 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 Vcvv 3453 〈cop 4839 “ cima 5660 ‘cfv 6565 (class class class)co 7450 ∈ cmpo 7452 ωcom 7910 reccrdg 8454 1c1 11239 + caddc 11241 seqcseq 14183 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-mpt 5192 df-xp 5663 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-iota 6519 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-seq 14184 |
| This theorem is used by: seqeq2d 14190 sadcom 16675 ressmulgnn 19338 cvmliftlem15 36272 |
| Copyright terms: Public domain | W3C validator |