Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > seqeq2 | 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 | simp1 987 | . . . . . . 7 ⊢ (( + = 𝑄 ∧ 𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑦 ∈ V) → + = 𝑄) | |
2 | 1 | oveqd 5858 | . . . . . 6 ⊢ (( + = 𝑄 ∧ 𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑦 ∈ V) → (𝑦 + (𝐹‘(𝑥 + 1))) = (𝑦𝑄(𝐹‘(𝑥 + 1)))) |
3 | 2 | opeq2d 3764 | . . . . 5 ⊢ (( + = 𝑄 ∧ 𝑥 ∈ (ℤ≥‘𝑀) ∧ 𝑦 ∈ V) → 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉 = 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉) |
4 | 3 | mpoeq3dva 5902 | . . . 4 ⊢ ( + = 𝑄 → (𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉) = (𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉)) |
5 | freceq1 6356 | . . . 4 ⊢ ((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉) = (𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉) → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉)) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ ( + = 𝑄 → frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉)) |
7 | 6 | rneqd 4832 | . 2 ⊢ ( + = 𝑄 → ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) = ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉)) |
8 | df-seqfrec 10377 | . 2 ⊢ seq𝑀( + , 𝐹) = ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦 + (𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) | |
9 | df-seqfrec 10377 | . 2 ⊢ seq𝑀(𝑄, 𝐹) = ran frec((𝑥 ∈ (ℤ≥‘𝑀), 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑦𝑄(𝐹‘(𝑥 + 1)))〉), 〈𝑀, (𝐹‘𝑀)〉) | |
10 | 7, 8, 9 | 3eqtr4g 2223 | 1 ⊢ ( + = 𝑄 → seq𝑀( + , 𝐹) = seq𝑀(𝑄, 𝐹)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 Vcvv 2725 〈cop 3578 ran crn 4604 ‘cfv 5187 (class class class)co 5841 ∈ cmpo 5843 freccfrec 6354 1c1 7750 + caddc 7752 ℤ≥cuz 9462 seqcseq 10376 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2296 df-ral 2448 df-rex 2449 df-v 2727 df-un 3119 df-in 3121 df-ss 3128 df-sn 3581 df-pr 3582 df-op 3584 df-uni 3789 df-br 3982 df-opab 4043 df-mpt 4044 df-cnv 4611 df-dm 4613 df-rn 4614 df-res 4615 df-iota 5152 df-fv 5195 df-ov 5844 df-oprab 5845 df-mpo 5846 df-recs 6269 df-frec 6355 df-seqfrec 10377 |
This theorem is referenced by: seqeq2d 10383 resqrex 10964 nninfdc 12382 |
Copyright terms: Public domain | W3C validator |