ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  seq3homo GIF version

Theorem seq3homo 10283
Description: Apply a homomorphism to a sequence. (Contributed by Jim Kingdon, 10-Oct-2022.)
Hypotheses
Ref Expression
seq3homo.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
seq3homo.2 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
seq3homo.3 (𝜑𝑁 ∈ (ℤ𝑀))
seq3homo.4 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)))
seq3homo.5 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐻‘(𝐹𝑥)) = (𝐺𝑥))
seq3homo.g ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
seq3homo.qcl ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
Assertion
Ref Expression
seq3homo (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))
Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐻,𝑦   𝑥,𝑀,𝑦   𝑥,𝑁,𝑦   𝜑,𝑥,𝑦   𝑥,𝐺   𝑥, + ,𝑦   𝑥,𝑄,𝑦   𝑥,𝑆,𝑦   𝑦,𝐺

Proof of Theorem seq3homo
Dummy variables 𝑛 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 seq3homo.3 . 2 (𝜑𝑁 ∈ (ℤ𝑀))
2 2fveq3 5426 . . . . 5 (𝑤 = 𝑀 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)))
3 fveq2 5421 . . . . 5 (𝑤 = 𝑀 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑀))
42, 3eqeq12d 2154 . . . 4 (𝑤 = 𝑀 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
54imbi2d 229 . . 3 (𝑤 = 𝑀 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))))
6 2fveq3 5426 . . . . 5 (𝑤 = 𝑛 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
7 fveq2 5421 . . . . 5 (𝑤 = 𝑛 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑛))
86, 7eqeq12d 2154 . . . 4 (𝑤 = 𝑛 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛)))
98imbi2d 229 . . 3 (𝑤 = 𝑛 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛))))
10 2fveq3 5426 . . . . 5 (𝑤 = (𝑛 + 1) → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))))
11 fveq2 5421 . . . . 5 (𝑤 = (𝑛 + 1) → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))
1210, 11eqeq12d 2154 . . . 4 (𝑤 = (𝑛 + 1) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
1312imbi2d 229 . . 3 (𝑤 = (𝑛 + 1) → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
14 2fveq3 5426 . . . . 5 (𝑤 = 𝑁 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)))
15 fveq2 5421 . . . . 5 (𝑤 = 𝑁 → (seq𝑀(𝑄, 𝐺)‘𝑤) = (seq𝑀(𝑄, 𝐺)‘𝑁))
1614, 15eqeq12d 2154 . . . 4 (𝑤 = 𝑁 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤) ↔ (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
1716imbi2d 229 . . 3 (𝑤 = 𝑁 → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑤)) = (seq𝑀(𝑄, 𝐺)‘𝑤)) ↔ (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))))
18 2fveq3 5426 . . . . . . 7 (𝑥 = 𝑀 → (𝐻‘(𝐹𝑥)) = (𝐻‘(𝐹𝑀)))
19 fveq2 5421 . . . . . . 7 (𝑥 = 𝑀 → (𝐺𝑥) = (𝐺𝑀))
2018, 19eqeq12d 2154 . . . . . 6 (𝑥 = 𝑀 → ((𝐻‘(𝐹𝑥)) = (𝐺𝑥) ↔ (𝐻‘(𝐹𝑀)) = (𝐺𝑀)))
21 seq3homo.5 . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐻‘(𝐹𝑥)) = (𝐺𝑥))
2221ralrimiva 2505 . . . . . 6 (𝜑 → ∀𝑥 ∈ (ℤ𝑀)(𝐻‘(𝐹𝑥)) = (𝐺𝑥))
23 eluzel2 9331 . . . . . . . 8 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
241, 23syl 14 . . . . . . 7 (𝜑𝑀 ∈ ℤ)
25 uzid 9340 . . . . . . 7 (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ𝑀))
2624, 25syl 14 . . . . . 6 (𝜑𝑀 ∈ (ℤ𝑀))
2720, 22, 26rspcdva 2794 . . . . 5 (𝜑 → (𝐻‘(𝐹𝑀)) = (𝐺𝑀))
28 seq3homo.2 . . . . . . 7 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
29 seq3homo.1 . . . . . . 7 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
3024, 28, 29seq3-1 10233 . . . . . 6 (𝜑 → (seq𝑀( + , 𝐹)‘𝑀) = (𝐹𝑀))
3130fveq2d 5425 . . . . 5 (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (𝐻‘(𝐹𝑀)))
32 seq3homo.g . . . . . 6 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
33 seq3homo.qcl . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
3424, 32, 33seq3-1 10233 . . . . 5 (𝜑 → (seq𝑀(𝑄, 𝐺)‘𝑀) = (𝐺𝑀))
3527, 31, 343eqtr4d 2182 . . . 4 (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀))
3635a1i 9 . . 3 (𝑀 ∈ ℤ → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑀)) = (seq𝑀(𝑄, 𝐺)‘𝑀)))
37 oveq1 5781 . . . . . 6 ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
38 simpr 109 . . . . . . . . . 10 ((𝜑𝑛 ∈ (ℤ𝑀)) → 𝑛 ∈ (ℤ𝑀))
3928adantlr 468 . . . . . . . . . 10 (((𝜑𝑛 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐹𝑥) ∈ 𝑆)
4029adantlr 468 . . . . . . . . . 10 (((𝜑𝑛 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
4138, 39, 40seq3p1 10235 . . . . . . . . 9 ((𝜑𝑛 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘(𝑛 + 1)) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
4241fveq2d 5425 . . . . . . . 8 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
43 seq3homo.4 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)))
4443ralrimivva 2514 . . . . . . . . . 10 (𝜑 → ∀𝑥𝑆𝑦𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)))
4544adantr 274 . . . . . . . . 9 ((𝜑𝑛 ∈ (ℤ𝑀)) → ∀𝑥𝑆𝑦𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)))
46 eqid 2139 . . . . . . . . . . . 12 (ℤ𝑀) = (ℤ𝑀)
4746, 24, 28, 29seqf 10234 . . . . . . . . . . 11 (𝜑 → seq𝑀( + , 𝐹):(ℤ𝑀)⟶𝑆)
4847ffvelrnda 5555 . . . . . . . . . 10 ((𝜑𝑛 ∈ (ℤ𝑀)) → (seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆)
49 fveq2 5421 . . . . . . . . . . . 12 (𝑥 = (𝑛 + 1) → (𝐹𝑥) = (𝐹‘(𝑛 + 1)))
5049eleq1d 2208 . . . . . . . . . . 11 (𝑥 = (𝑛 + 1) → ((𝐹𝑥) ∈ 𝑆 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑆))
5128ralrimiva 2505 . . . . . . . . . . . 12 (𝜑 → ∀𝑥 ∈ (ℤ𝑀)(𝐹𝑥) ∈ 𝑆)
5251adantr 274 . . . . . . . . . . 11 ((𝜑𝑛 ∈ (ℤ𝑀)) → ∀𝑥 ∈ (ℤ𝑀)(𝐹𝑥) ∈ 𝑆)
53 peano2uz 9378 . . . . . . . . . . . 12 (𝑛 ∈ (ℤ𝑀) → (𝑛 + 1) ∈ (ℤ𝑀))
5438, 53syl 14 . . . . . . . . . . 11 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝑛 + 1) ∈ (ℤ𝑀))
5550, 52, 54rspcdva 2794 . . . . . . . . . 10 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐹‘(𝑛 + 1)) ∈ 𝑆)
56 oveq1 5781 . . . . . . . . . . . . 13 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝑥 + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦))
5756fveq2d 5425 . . . . . . . . . . . 12 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻‘(𝑥 + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)))
58 fveq2 5421 . . . . . . . . . . . . 13 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → (𝐻𝑥) = (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)))
5958oveq1d 5789 . . . . . . . . . . . 12 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻𝑥)𝑄(𝐻𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻𝑦)))
6057, 59eqeq12d 2154 . . . . . . . . . . 11 (𝑥 = (seq𝑀( + , 𝐹)‘𝑛) → ((𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻𝑦))))
61 oveq2 5782 . . . . . . . . . . . . 13 (𝑦 = (𝐹‘(𝑛 + 1)) → ((seq𝑀( + , 𝐹)‘𝑛) + 𝑦) = ((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1))))
6261fveq2d 5425 . . . . . . . . . . . 12 (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))))
63 fveq2 5421 . . . . . . . . . . . . 13 (𝑦 = (𝐹‘(𝑛 + 1)) → (𝐻𝑦) = (𝐻‘(𝐹‘(𝑛 + 1))))
6463oveq2d 5790 . . . . . . . . . . . 12 (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
6562, 64eqeq12d 2154 . . . . . . . . . . 11 (𝑦 = (𝐹‘(𝑛 + 1)) → ((𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + 𝑦)) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻𝑦)) ↔ (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
6660, 65rspc2v 2802 . . . . . . . . . 10 (((seq𝑀( + , 𝐹)‘𝑛) ∈ 𝑆 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑆) → (∀𝑥𝑆𝑦𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
6748, 55, 66syl2anc 408 . . . . . . . . 9 ((𝜑𝑛 ∈ (ℤ𝑀)) → (∀𝑥𝑆𝑦𝑆 (𝐻‘(𝑥 + 𝑦)) = ((𝐻𝑥)𝑄(𝐻𝑦)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1))))))
6845, 67mpd 13 . . . . . . . 8 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐻‘((seq𝑀( + , 𝐹)‘𝑛) + (𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))))
69 2fveq3 5426 . . . . . . . . . . 11 (𝑥 = (𝑛 + 1) → (𝐻‘(𝐹𝑥)) = (𝐻‘(𝐹‘(𝑛 + 1))))
70 fveq2 5421 . . . . . . . . . . 11 (𝑥 = (𝑛 + 1) → (𝐺𝑥) = (𝐺‘(𝑛 + 1)))
7169, 70eqeq12d 2154 . . . . . . . . . 10 (𝑥 = (𝑛 + 1) → ((𝐻‘(𝐹𝑥)) = (𝐺𝑥) ↔ (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1))))
7222adantr 274 . . . . . . . . . 10 ((𝜑𝑛 ∈ (ℤ𝑀)) → ∀𝑥 ∈ (ℤ𝑀)(𝐻‘(𝐹𝑥)) = (𝐺𝑥))
7371, 72, 54rspcdva 2794 . . . . . . . . 9 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐻‘(𝐹‘(𝑛 + 1))) = (𝐺‘(𝑛 + 1)))
7473oveq2d 5790 . . . . . . . 8 ((𝜑𝑛 ∈ (ℤ𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐻‘(𝐹‘(𝑛 + 1)))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
7542, 68, 743eqtrd 2176 . . . . . . 7 ((𝜑𝑛 ∈ (ℤ𝑀)) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))))
7632adantlr 468 . . . . . . . 8 (((𝜑𝑛 ∈ (ℤ𝑀)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
7733adantlr 468 . . . . . . . 8 (((𝜑𝑛 ∈ (ℤ𝑀)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝑄𝑦) ∈ 𝑆)
7838, 76, 77seq3p1 10235 . . . . . . 7 ((𝜑𝑛 ∈ (ℤ𝑀)) → (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1))))
7975, 78eqeq12d 2154 . . . . . 6 ((𝜑𝑛 ∈ (ℤ𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)) ↔ ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛))𝑄(𝐺‘(𝑛 + 1))) = ((seq𝑀(𝑄, 𝐺)‘𝑛)𝑄(𝐺‘(𝑛 + 1)))))
8037, 79syl5ibr 155 . . . . 5 ((𝜑𝑛 ∈ (ℤ𝑀)) → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1))))
8180expcom 115 . . . 4 (𝑛 ∈ (ℤ𝑀) → (𝜑 → ((𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛) → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
8281a2d 26 . . 3 (𝑛 ∈ (ℤ𝑀) → ((𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑛)) = (seq𝑀(𝑄, 𝐺)‘𝑛)) → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘(𝑛 + 1))) = (seq𝑀(𝑄, 𝐺)‘(𝑛 + 1)))))
835, 9, 13, 17, 36, 82uzind4 9383 . 2 (𝑁 ∈ (ℤ𝑀) → (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁)))
841, 83mpcom 36 1 (𝜑 → (𝐻‘(seq𝑀( + , 𝐹)‘𝑁)) = (seq𝑀(𝑄, 𝐺)‘𝑁))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wcel 1480  wral 2416  cfv 5123  (class class class)co 5774  1c1 7621   + caddc 7623  cz 9054  cuz 9326  seqcseq 10218
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-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502  ax-cnex 7711  ax-resscn 7712  ax-1cn 7713  ax-1re 7714  ax-icn 7715  ax-addcl 7716  ax-addrcl 7717  ax-mulcl 7718  ax-addcom 7720  ax-addass 7722  ax-distr 7724  ax-i2m1 7725  ax-0lt1 7726  ax-0id 7728  ax-rnegex 7729  ax-cnre 7731  ax-pre-ltirr 7732  ax-pre-ltwlin 7733  ax-pre-lttrn 7734  ax-pre-ltadd 7736
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-ilim 4291  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-frec 6288  df-pnf 7802  df-mnf 7803  df-xr 7804  df-ltxr 7805  df-le 7806  df-sub 7935  df-neg 7936  df-inn 8721  df-n0 8978  df-z 9055  df-uz 9327  df-seqfrec 10219
This theorem is referenced by:  seqfeq3  10285  seq3distr  10286  efcj  11379
  Copyright terms: Public domain W3C validator