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

Theorem bcxmas 15856
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 15855 . . 3 (𝑚 = 0 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 0)C0))
2 oveq2 7418 . . . 4 (𝑚 = 0 → (0...𝑚) = (0...0))
32sumeq1d 15721 . . 3 (𝑚 = 0 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
41, 3eqeq12d 2752 . 2 (𝑚 = 0 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗)))
5 bcxmaslem1 15855 . . 3 (𝑚 = 𝑘 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑘)C𝑘))
6 oveq2 7418 . . . 4 (𝑚 = 𝑘 → (0...𝑚) = (0...𝑘))
76sumeq1d 15721 . . 3 (𝑚 = 𝑘 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗))
85, 7eqeq12d 2752 . 2 (𝑚 = 𝑘 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)))
9 bcxmaslem1 15855 . . 3 (𝑚 = (𝑘 + 1) → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
10 oveq2 7418 . . . 4 (𝑚 = (𝑘 + 1) → (0...𝑚) = (0...(𝑘 + 1)))
1110sumeq1d 15721 . . 3 (𝑚 = (𝑘 + 1) → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
129, 11eqeq12d 2752 . 2 (𝑚 = (𝑘 + 1) → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗)))
13 bcxmaslem1 15855 . . 3 (𝑚 = 𝑀 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑀)C𝑀))
14 oveq2 7418 . . . 4 (𝑚 = 𝑀 → (0...𝑚) = (0...𝑀))
1514sumeq1d 15721 . . 3 (𝑚 = 𝑀 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
1613, 15eqeq12d 2752 . 2 (𝑚 = 𝑀 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗)))
17 0nn0 12521 . . . 4 0 ∈ ℕ0
18 nn0addcl 12541 . . . . 5 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝑁 + 0) ∈ ℕ0)
19 bcn0 14333 . . . . 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 12604 . . . 4 0 ∈ ℤ
23 1nn0 12522 . . . . . 6 1 ∈ ℕ0
2421, 23eqeltrdi 2843 . . . . 5 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℕ0)
2524nn0cnd 12569 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℂ)
26 bcxmaslem1 15855 . . . . 5 (𝑗 = 0 → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2726fsum1 15768 . . . 4 ((0 ∈ ℤ ∧ ((𝑁 + 0)C0) ∈ ℂ) → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2822, 25, 27sylancr 587 . . 3 (𝑁 ∈ ℕ0 → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
29 peano2nn0 12546 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
30 nn0addcl 12541 . . . . 5 (((𝑁 + 1) ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 1) + 0) ∈ ℕ0)
3129, 17, 30sylancl 586 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 0) ∈ ℕ0)
32 bcn0 14333 . . . 4 (((𝑁 + 1) + 0) ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3331, 32syl 17 . . 3 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3421, 28, 333eqtr4rd 2782 . 2 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
35 simpr 484 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
36 elnn0uz 12902 . . . . . . 7 (𝑘 ∈ ℕ0𝑘 ∈ (ℤ‘0))
3735, 36sylib 218 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ‘0))
38 simpl 482 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ0)
39 elfznn0 13642 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℕ0)
40 nn0addcl 12541 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑗 ∈ ℕ0) → (𝑁 + 𝑗) ∈ ℕ0)
4138, 39, 40syl2an 596 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → (𝑁 + 𝑗) ∈ ℕ0)
42 elfzelz 13546 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℤ)
4342adantl 481 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → 𝑗 ∈ ℤ)
44 bccl 14345 . . . . . . . 8 (((𝑁 + 𝑗) ∈ ℕ0𝑗 ∈ ℤ) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4541, 43, 44syl2anc 584 . . . . . . 7 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4645nn0cnd 12569 . . . . . 6 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℂ)
47 bcxmaslem1 15855 . . . . . 6 (𝑗 = (𝑘 + 1) → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + (𝑘 + 1))C(𝑘 + 1)))
4837, 46, 47fsump1 15777 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))))
49 nn0cn 12516 . . . . . . . . 9 (𝑁 ∈ ℕ0𝑁 ∈ ℂ)
5049adantr 480 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℂ)
51 nn0cn 12516 . . . . . . . . 9 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
5251adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
53 1cnd 11235 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 1 ∈ ℂ)
54 add32r 11460 . . . . . . . 8 ((𝑁 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5550, 52, 53, 54syl3anc 1373 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5655oveq1d 7425 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + (𝑘 + 1))C(𝑘 + 1)) = (((𝑁 + 1) + 𝑘)C(𝑘 + 1)))
5756oveq2d 7426 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5848, 57eqtrd 2771 . . . 4 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5958adantr 480 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
60 oveq1 7417 . . . 4 ((((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
6160adantl 481 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
62 ax-1cn 11192 . . . . . . . . 9 1 ∈ ℂ
63 pncan 11493 . . . . . . . . 9 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
6452, 62, 63sylancl 586 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
6564oveq2d 7426 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1)) = (((𝑁 + 1) + 𝑘)C𝑘))
6665oveq2d 7426 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)))
67 nn0addcl 12541 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
6829, 67sylan 580 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
69 nn0p1nn 12545 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
7069adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
7170nnzd 12620 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℤ)
72 bcpasc 14344 . . . . . . 7 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7368, 71, 72syl2anc 584 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7466, 73eqtr3d 2773 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
75 nn0p1nn 12545 . . . . . . . . . 10 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
76 nnnn0addcl 12536 . . . . . . . . . 10 (((𝑁 + 1) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7775, 76sylan 580 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7877nnnn0d 12567 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
79 bccl 14345 . . . . . . . 8 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8078, 71, 79syl2anc 584 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8180nn0cnd 12569 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℂ)
82 nn0z 12618 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℤ)
8382adantl 481 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
84 bccl 14345 . . . . . . . . 9 ((((𝑁 + 1) + 𝑘) ∈ ℕ0𝑘 ∈ ℤ) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8567, 83, 84syl2anc 584 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8629, 85sylan 580 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8786nn0cnd 12569 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℂ)
8881, 87addcomd 11442 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
89 peano2cn 11412 . . . . . . . . 9 (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ)
9049, 89syl 17 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
9190adantr 480 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + 1) ∈ ℂ)
9291, 52, 53addassd 11262 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘) + 1) = ((𝑁 + 1) + (𝑘 + 1)))
9392oveq1d 7425 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9474, 88, 933eqtr3d 2779 . . . 4 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9594adantr 480 . . 3 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9659, 61, 953eqtr2rd 2778 . 2 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
974, 8, 12, 16, 34, 96nn0indd 12695 1 ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  cfv 6536  (class class class)co 7410  cc 11132  0cc0 11134  1c1 11135   + caddc 11137  cmin 11471  cn 12245  0cn0 12506  cz 12593  cuz 12857  ...cfz 13529  Ccbc 14325  Σcsu 15707
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734  ax-inf2 9660  ax-cnex 11190  ax-resscn 11191  ax-1cn 11192  ax-icn 11193  ax-addcl 11194  ax-addrcl 11195  ax-mulcl 11196  ax-mulrcl 11197  ax-mulcom 11198  ax-addass 11199  ax-mulass 11200  ax-distr 11201  ax-i2m1 11202  ax-1ne0 11203  ax-1rid 11204  ax-rnegex 11205  ax-rrecex 11206  ax-cnre 11207  ax-pre-lttri 11208  ax-pre-lttrn 11209  ax-pre-ltadd 11210  ax-pre-mulgt0 11211  ax-pre-sup 11212
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-er 8724  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-sup 9459  df-oi 9529  df-card 9958  df-pnf 11276  df-mnf 11277  df-xr 11278  df-ltxr 11279  df-le 11280  df-sub 11473  df-neg 11474  df-div 11900  df-nn 12246  df-2 12308  df-3 12309  df-n0 12507  df-z 12594  df-uz 12858  df-rp 13014  df-fz 13530  df-fzo 13677  df-seq 14025  df-exp 14085  df-fac 14297  df-bc 14326  df-hash 14354  df-cj 15123  df-re 15124  df-im 15125  df-sqrt 15259  df-abs 15260  df-clim 15509  df-sum 15708
This theorem is referenced by:  arisum  15881
  Copyright terms: Public domain W3C validator