MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bcxmas Structured version   Visualization version   GIF version

Theorem bcxmas 15286
Description: Parallel summation (Christmas Stocking) theorem for Pascal's Triangle. (Contributed by Paul Chapman, 18-May-2007.) (Revised by Mario Carneiro, 24-Apr-2014.)
Assertion
Ref Expression
bcxmas ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Distinct variable groups:   𝑗,𝑀   𝑗,𝑁

Proof of Theorem bcxmas
Dummy variables 𝑚 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bcxmaslem1 15285 . . 3 (𝑚 = 0 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 0)C0))
2 oveq2 7181 . . . 4 (𝑚 = 0 → (0...𝑚) = (0...0))
32sumeq1d 15154 . . 3 (𝑚 = 0 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
41, 3eqeq12d 2755 . 2 (𝑚 = 0 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗)))
5 bcxmaslem1 15285 . . 3 (𝑚 = 𝑘 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑘)C𝑘))
6 oveq2 7181 . . . 4 (𝑚 = 𝑘 → (0...𝑚) = (0...𝑘))
76sumeq1d 15154 . . 3 (𝑚 = 𝑘 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗))
85, 7eqeq12d 2755 . 2 (𝑚 = 𝑘 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)))
9 bcxmaslem1 15285 . . 3 (𝑚 = (𝑘 + 1) → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
10 oveq2 7181 . . . 4 (𝑚 = (𝑘 + 1) → (0...𝑚) = (0...(𝑘 + 1)))
1110sumeq1d 15154 . . 3 (𝑚 = (𝑘 + 1) → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
129, 11eqeq12d 2755 . 2 (𝑚 = (𝑘 + 1) → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗)))
13 bcxmaslem1 15285 . . 3 (𝑚 = 𝑀 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑀)C𝑀))
14 oveq2 7181 . . . 4 (𝑚 = 𝑀 → (0...𝑚) = (0...𝑀))
1514sumeq1d 15154 . . 3 (𝑚 = 𝑀 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
1613, 15eqeq12d 2755 . 2 (𝑚 = 𝑀 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗)))
17 0nn0 11994 . . . 4 0 ∈ ℕ0
18 nn0addcl 12014 . . . . 5 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝑁 + 0) ∈ ℕ0)
19 bcn0 13765 . . . . 5 ((𝑁 + 0) ∈ ℕ0 → ((𝑁 + 0)C0) = 1)
2018, 19syl 17 . . . 4 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 0)C0) = 1)
2117, 20mpan2 691 . . 3 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) = 1)
22 0z 12076 . . . 4 0 ∈ ℤ
23 1nn0 11995 . . . . . 6 1 ∈ ℕ0
2421, 23eqeltrdi 2842 . . . . 5 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℕ0)
2524nn0cnd 12041 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℂ)
26 bcxmaslem1 15285 . . . . 5 (𝑗 = 0 → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2726fsum1 15198 . . . 4 ((0 ∈ ℤ ∧ ((𝑁 + 0)C0) ∈ ℂ) → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2822, 25, 27sylancr 590 . . 3 (𝑁 ∈ ℕ0 → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
29 peano2nn0 12019 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
30 nn0addcl 12014 . . . . 5 (((𝑁 + 1) ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 1) + 0) ∈ ℕ0)
3129, 17, 30sylancl 589 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 0) ∈ ℕ0)
32 bcn0 13765 . . . 4 (((𝑁 + 1) + 0) ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3331, 32syl 17 . . 3 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3421, 28, 333eqtr4rd 2785 . 2 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
35 simpr 488 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
36 elnn0uz 12368 . . . . . . 7 (𝑘 ∈ ℕ0𝑘 ∈ (ℤ‘0))
3735, 36sylib 221 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ‘0))
38 simpl 486 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ0)
39 elfznn0 13094 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℕ0)
40 nn0addcl 12014 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑗 ∈ ℕ0) → (𝑁 + 𝑗) ∈ ℕ0)
4138, 39, 40syl2an 599 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → (𝑁 + 𝑗) ∈ ℕ0)
42 elfzelz 13001 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℤ)
4342adantl 485 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → 𝑗 ∈ ℤ)
44 bccl 13777 . . . . . . . 8 (((𝑁 + 𝑗) ∈ ℕ0𝑗 ∈ ℤ) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4541, 43, 44syl2anc 587 . . . . . . 7 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4645nn0cnd 12041 . . . . . 6 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℂ)
47 bcxmaslem1 15285 . . . . . 6 (𝑗 = (𝑘 + 1) → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + (𝑘 + 1))C(𝑘 + 1)))
4837, 46, 47fsump1 15207 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))))
49 nn0cn 11989 . . . . . . . . 9 (𝑁 ∈ ℕ0𝑁 ∈ ℂ)
5049adantr 484 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℂ)
51 nn0cn 11989 . . . . . . . . 9 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
5251adantl 485 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
53 1cnd 10717 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 1 ∈ ℂ)
54 add32r 10940 . . . . . . . 8 ((𝑁 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5550, 52, 53, 54syl3anc 1372 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5655oveq1d 7188 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + (𝑘 + 1))C(𝑘 + 1)) = (((𝑁 + 1) + 𝑘)C(𝑘 + 1)))
5756oveq2d 7189 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5848, 57eqtrd 2774 . . . 4 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5958adantr 484 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
60 oveq1 7180 . . . 4 ((((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
6160adantl 485 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
62 ax-1cn 10676 . . . . . . . . 9 1 ∈ ℂ
63 pncan 10973 . . . . . . . . 9 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
6452, 62, 63sylancl 589 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
6564oveq2d 7189 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1)) = (((𝑁 + 1) + 𝑘)C𝑘))
6665oveq2d 7189 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)))
67 nn0addcl 12014 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
6829, 67sylan 583 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
69 nn0p1nn 12018 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
7069adantl 485 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
7170nnzd 12170 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℤ)
72 bcpasc 13776 . . . . . . 7 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7368, 71, 72syl2anc 587 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7466, 73eqtr3d 2776 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
75 nn0p1nn 12018 . . . . . . . . . 10 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
76 nnnn0addcl 12009 . . . . . . . . . 10 (((𝑁 + 1) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7775, 76sylan 583 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7877nnnn0d 12039 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
79 bccl 13777 . . . . . . . 8 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8078, 71, 79syl2anc 587 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8180nn0cnd 12041 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℂ)
82 nn0z 12089 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℤ)
8382adantl 485 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
84 bccl 13777 . . . . . . . . 9 ((((𝑁 + 1) + 𝑘) ∈ ℕ0𝑘 ∈ ℤ) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8567, 83, 84syl2anc 587 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8629, 85sylan 583 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8786nn0cnd 12041 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℂ)
8881, 87addcomd 10923 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
89 peano2cn 10893 . . . . . . . . 9 (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ)
9049, 89syl 17 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
9190adantr 484 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + 1) ∈ ℂ)
9291, 52, 53addassd 10744 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘) + 1) = ((𝑁 + 1) + (𝑘 + 1)))
9392oveq1d 7188 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9474, 88, 933eqtr3d 2782 . . . 4 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9594adantr 484 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9659, 61, 953eqtr2rd 2781 . 2 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
974, 8, 12, 16, 34, 96nn0indd 12163 1 ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1542  wcel 2114  cfv 6340  (class class class)co 7173  cc 10616  0cc0 10618  1c1 10619   + caddc 10621  cmin 10951  cn 11719  0cn0 11979  cz 12065  cuz 12327  ...cfz 12984  Ccbc 13757  Σcsu 15138
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5155  ax-sep 5168  ax-nul 5175  ax-pow 5233  ax-pr 5297  ax-un 7482  ax-inf2 9180  ax-cnex 10674  ax-resscn 10675  ax-1cn 10676  ax-icn 10677  ax-addcl 10678  ax-addrcl 10679  ax-mulcl 10680  ax-mulrcl 10681  ax-mulcom 10682  ax-addass 10683  ax-mulass 10684  ax-distr 10685  ax-i2m1 10686  ax-1ne0 10687  ax-1rid 10688  ax-rnegex 10689  ax-rrecex 10690  ax-cnre 10691  ax-pre-lttri 10692  ax-pre-lttrn 10693  ax-pre-ltadd 10694  ax-pre-mulgt0 10695  ax-pre-sup 10696
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-nel 3040  df-ral 3059  df-rex 3060  df-reu 3061  df-rmo 3062  df-rab 3063  df-v 3401  df-sbc 3682  df-csb 3792  df-dif 3847  df-un 3849  df-in 3851  df-ss 3861  df-pss 3863  df-nul 4213  df-if 4416  df-pw 4491  df-sn 4518  df-pr 4520  df-tp 4522  df-op 4524  df-uni 4798  df-int 4838  df-iun 4884  df-br 5032  df-opab 5094  df-mpt 5112  df-tr 5138  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5484  df-se 5485  df-we 5486  df-xp 5532  df-rel 5533  df-cnv 5534  df-co 5535  df-dm 5536  df-rn 5537  df-res 5538  df-ima 5539  df-pred 6130  df-ord 6176  df-on 6177  df-lim 6178  df-suc 6179  df-iota 6298  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-isom 6349  df-riota 7130  df-ov 7176  df-oprab 7177  df-mpo 7178  df-om 7603  df-1st 7717  df-2nd 7718  df-wrecs 7979  df-recs 8040  df-rdg 8078  df-1o 8134  df-er 8323  df-en 8559  df-dom 8560  df-sdom 8561  df-fin 8562  df-sup 8982  df-oi 9050  df-card 9444  df-pnf 10758  df-mnf 10759  df-xr 10760  df-ltxr 10761  df-le 10762  df-sub 10953  df-neg 10954  df-div 11379  df-nn 11720  df-2 11782  df-3 11783  df-n0 11980  df-z 12066  df-uz 12328  df-rp 12476  df-fz 12985  df-fzo 13128  df-seq 13464  df-exp 13525  df-fac 13729  df-bc 13758  df-hash 13786  df-cj 14551  df-re 14552  df-im 14553  df-sqrt 14687  df-abs 14688  df-clim 14938  df-sum 15139
This theorem is referenced by:  arisum  15311
  Copyright terms: Public domain W3C validator