| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > seqeq123d | GIF version | ||
| Description: Equality deduction for the sequence builder operation. (Contributed by Mario Carneiro, 7-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqeq123d.1 | ⊢ (𝜑 → 𝑀 = 𝑁) |
| seqeq123d.2 | ⊢ (𝜑 → + = 𝑄) |
| seqeq123d.3 | ⊢ (𝜑 → 𝐹 = 𝐺) |
| Ref | Expression |
|---|---|
| seqeq123d | ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | seqeq123d.1 | . . 3 ⊢ (𝜑 → 𝑀 = 𝑁) | |
| 2 | 1 | seqeq1d 10759 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁( + , 𝐹)) |
| 3 | seqeq123d.2 | . . 3 ⊢ (𝜑 → + = 𝑄) | |
| 4 | 3 | seqeq2d 10760 | . 2 ⊢ (𝜑 → seq𝑁( + , 𝐹) = seq𝑁(𝑄, 𝐹)) |
| 5 | seqeq123d.3 | . . 3 ⊢ (𝜑 → 𝐹 = 𝐺) | |
| 6 | 5 | seqeq3d 10761 | . 2 ⊢ (𝜑 → seq𝑁(𝑄, 𝐹) = seq𝑁(𝑄, 𝐺)) |
| 7 | 2, 4, 6 | 3eqtrd 2268 | 1 ⊢ (𝜑 → seq𝑀( + , 𝐹) = seq𝑁(𝑄, 𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 seqcseq 10753 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-mpt 4157 df-cnv 4739 df-dm 4741 df-rn 4742 df-res 4743 df-iota 5293 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-recs 6514 df-frec 6600 df-seqfrec 10754 |
| This theorem is referenced by: igsumvalx 13533 |
| Copyright terms: Public domain | W3C validator |