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

Theorem bcxmas 15868
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 15867 . . 3 (𝑚 = 0 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 0)C0))
2 oveq2 7439 . . . 4 (𝑚 = 0 → (0...𝑚) = (0...0))
32sumeq1d 15733 . . 3 (𝑚 = 0 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
41, 3eqeq12d 2751 . 2 (𝑚 = 0 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗)))
5 bcxmaslem1 15867 . . 3 (𝑚 = 𝑘 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑘)C𝑘))
6 oveq2 7439 . . . 4 (𝑚 = 𝑘 → (0...𝑚) = (0...𝑘))
76sumeq1d 15733 . . 3 (𝑚 = 𝑘 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗))
85, 7eqeq12d 2751 . 2 (𝑚 = 𝑘 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)))
9 bcxmaslem1 15867 . . 3 (𝑚 = (𝑘 + 1) → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
10 oveq2 7439 . . . 4 (𝑚 = (𝑘 + 1) → (0...𝑚) = (0...(𝑘 + 1)))
1110sumeq1d 15733 . . 3 (𝑚 = (𝑘 + 1) → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
129, 11eqeq12d 2751 . 2 (𝑚 = (𝑘 + 1) → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗)))
13 bcxmaslem1 15867 . . 3 (𝑚 = 𝑀 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑀)C𝑀))
14 oveq2 7439 . . . 4 (𝑚 = 𝑀 → (0...𝑚) = (0...𝑀))
1514sumeq1d 15733 . . 3 (𝑚 = 𝑀 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
1613, 15eqeq12d 2751 . 2 (𝑚 = 𝑀 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗)))
17 0nn0 12539 . . . 4 0 ∈ ℕ0
18 nn0addcl 12559 . . . . 5 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝑁 + 0) ∈ ℕ0)
19 bcn0 14346 . . . . 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 12622 . . . 4 0 ∈ ℤ
23 1nn0 12540 . . . . . 6 1 ∈ ℕ0
2421, 23eqeltrdi 2847 . . . . 5 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℕ0)
2524nn0cnd 12587 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℂ)
26 bcxmaslem1 15867 . . . . 5 (𝑗 = 0 → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2726fsum1 15780 . . . 4 ((0 ∈ ℤ ∧ ((𝑁 + 0)C0) ∈ ℂ) → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2822, 25, 27sylancr 587 . . 3 (𝑁 ∈ ℕ0 → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
29 peano2nn0 12564 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
30 nn0addcl 12559 . . . . 5 (((𝑁 + 1) ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 1) + 0) ∈ ℕ0)
3129, 17, 30sylancl 586 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 0) ∈ ℕ0)
32 bcn0 14346 . . . 4 (((𝑁 + 1) + 0) ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3331, 32syl 17 . . 3 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3421, 28, 333eqtr4rd 2786 . 2 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
35 simpr 484 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
36 elnn0uz 12921 . . . . . . 7 (𝑘 ∈ ℕ0𝑘 ∈ (ℤ‘0))
3735, 36sylib 218 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ‘0))
38 simpl 482 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ0)
39 elfznn0 13657 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℕ0)
40 nn0addcl 12559 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑗 ∈ ℕ0) → (𝑁 + 𝑗) ∈ ℕ0)
4138, 39, 40syl2an 596 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → (𝑁 + 𝑗) ∈ ℕ0)
42 elfzelz 13561 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℤ)
4342adantl 481 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → 𝑗 ∈ ℤ)
44 bccl 14358 . . . . . . . 8 (((𝑁 + 𝑗) ∈ ℕ0𝑗 ∈ ℤ) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4541, 43, 44syl2anc 584 . . . . . . 7 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4645nn0cnd 12587 . . . . . 6 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℂ)
47 bcxmaslem1 15867 . . . . . 6 (𝑗 = (𝑘 + 1) → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + (𝑘 + 1))C(𝑘 + 1)))
4837, 46, 47fsump1 15789 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))))
49 nn0cn 12534 . . . . . . . . 9 (𝑁 ∈ ℕ0𝑁 ∈ ℂ)
5049adantr 480 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℂ)
51 nn0cn 12534 . . . . . . . . 9 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
5251adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
53 1cnd 11254 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 1 ∈ ℂ)
54 add32r 11479 . . . . . . . 8 ((𝑁 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5550, 52, 53, 54syl3anc 1370 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5655oveq1d 7446 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + (𝑘 + 1))C(𝑘 + 1)) = (((𝑁 + 1) + 𝑘)C(𝑘 + 1)))
5756oveq2d 7447 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5848, 57eqtrd 2775 . . . 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 7438 . . . 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 11211 . . . . . . . . 9 1 ∈ ℂ
63 pncan 11512 . . . . . . . . 9 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
6452, 62, 63sylancl 586 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
6564oveq2d 7447 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1)) = (((𝑁 + 1) + 𝑘)C𝑘))
6665oveq2d 7447 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)))
67 nn0addcl 12559 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
6829, 67sylan 580 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
69 nn0p1nn 12563 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
7069adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
7170nnzd 12638 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℤ)
72 bcpasc 14357 . . . . . . 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 2777 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
75 nn0p1nn 12563 . . . . . . . . . 10 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
76 nnnn0addcl 12554 . . . . . . . . . 10 (((𝑁 + 1) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7775, 76sylan 580 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7877nnnn0d 12585 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
79 bccl 14358 . . . . . . . 8 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8078, 71, 79syl2anc 584 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8180nn0cnd 12587 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℂ)
82 nn0z 12636 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℤ)
8382adantl 481 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
84 bccl 14358 . . . . . . . . 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 12587 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℂ)
8881, 87addcomd 11461 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
89 peano2cn 11431 . . . . . . . . 9 (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ)
9049, 89syl 17 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
9190adantr 480 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + 1) ∈ ℂ)
9291, 52, 53addassd 11281 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘) + 1) = ((𝑁 + 1) + (𝑘 + 1)))
9392oveq1d 7446 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9474, 88, 933eqtr3d 2783 . . . 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 2782 . 2 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
974, 8, 12, 16, 34, 96nn0indd 12713 1 ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2106  cfv 6563  (class class class)co 7431  cc 11151  0cc0 11153  1c1 11154   + caddc 11156  cmin 11490  cn 12264  0cn0 12524  cz 12611  cuz 12876  ...cfz 13544  Ccbc 14338  Σcsu 15719
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-inf2 9679  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-isom 6572  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-sup 9480  df-oi 9548  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-nn 12265  df-2 12327  df-3 12328  df-n0 12525  df-z 12612  df-uz 12877  df-rp 13033  df-fz 13545  df-fzo 13692  df-seq 14040  df-exp 14100  df-fac 14310  df-bc 14339  df-hash 14367  df-cj 15135  df-re 15136  df-im 15137  df-sqrt 15271  df-abs 15272  df-clim 15521  df-sum 15720
This theorem is referenced by:  arisum  15893
  Copyright terms: Public domain W3C validator