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

Theorem bcxmas 15801
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 15800 . . 3 (𝑚 = 0 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 0)C0))
2 oveq2 7395 . . . 4 (𝑚 = 0 → (0...𝑚) = (0...0))
32sumeq1d 15666 . . 3 (𝑚 = 0 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
41, 3eqeq12d 2745 . 2 (𝑚 = 0 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗)))
5 bcxmaslem1 15800 . . 3 (𝑚 = 𝑘 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑘)C𝑘))
6 oveq2 7395 . . . 4 (𝑚 = 𝑘 → (0...𝑚) = (0...𝑘))
76sumeq1d 15666 . . 3 (𝑚 = 𝑘 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗))
85, 7eqeq12d 2745 . 2 (𝑚 = 𝑘 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)))
9 bcxmaslem1 15800 . . 3 (𝑚 = (𝑘 + 1) → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
10 oveq2 7395 . . . 4 (𝑚 = (𝑘 + 1) → (0...𝑚) = (0...(𝑘 + 1)))
1110sumeq1d 15666 . . 3 (𝑚 = (𝑘 + 1) → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
129, 11eqeq12d 2745 . 2 (𝑚 = (𝑘 + 1) → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗)))
13 bcxmaslem1 15800 . . 3 (𝑚 = 𝑀 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑀)C𝑀))
14 oveq2 7395 . . . 4 (𝑚 = 𝑀 → (0...𝑚) = (0...𝑀))
1514sumeq1d 15666 . . 3 (𝑚 = 𝑀 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
1613, 15eqeq12d 2745 . 2 (𝑚 = 𝑀 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗)))
17 0nn0 12457 . . . 4 0 ∈ ℕ0
18 nn0addcl 12477 . . . . 5 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝑁 + 0) ∈ ℕ0)
19 bcn0 14275 . . . . 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 12540 . . . 4 0 ∈ ℤ
23 1nn0 12458 . . . . . 6 1 ∈ ℕ0
2421, 23eqeltrdi 2836 . . . . 5 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℕ0)
2524nn0cnd 12505 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℂ)
26 bcxmaslem1 15800 . . . . 5 (𝑗 = 0 → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2726fsum1 15713 . . . 4 ((0 ∈ ℤ ∧ ((𝑁 + 0)C0) ∈ ℂ) → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2822, 25, 27sylancr 587 . . 3 (𝑁 ∈ ℕ0 → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
29 peano2nn0 12482 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
30 nn0addcl 12477 . . . . 5 (((𝑁 + 1) ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 1) + 0) ∈ ℕ0)
3129, 17, 30sylancl 586 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 0) ∈ ℕ0)
32 bcn0 14275 . . . 4 (((𝑁 + 1) + 0) ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3331, 32syl 17 . . 3 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3421, 28, 333eqtr4rd 2775 . 2 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
35 simpr 484 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
36 elnn0uz 12838 . . . . . . 7 (𝑘 ∈ ℕ0𝑘 ∈ (ℤ‘0))
3735, 36sylib 218 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ‘0))
38 simpl 482 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ0)
39 elfznn0 13581 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℕ0)
40 nn0addcl 12477 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑗 ∈ ℕ0) → (𝑁 + 𝑗) ∈ ℕ0)
4138, 39, 40syl2an 596 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → (𝑁 + 𝑗) ∈ ℕ0)
42 elfzelz 13485 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℤ)
4342adantl 481 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → 𝑗 ∈ ℤ)
44 bccl 14287 . . . . . . . 8 (((𝑁 + 𝑗) ∈ ℕ0𝑗 ∈ ℤ) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4541, 43, 44syl2anc 584 . . . . . . 7 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4645nn0cnd 12505 . . . . . 6 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℂ)
47 bcxmaslem1 15800 . . . . . 6 (𝑗 = (𝑘 + 1) → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + (𝑘 + 1))C(𝑘 + 1)))
4837, 46, 47fsump1 15722 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))))
49 nn0cn 12452 . . . . . . . . 9 (𝑁 ∈ ℕ0𝑁 ∈ ℂ)
5049adantr 480 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℂ)
51 nn0cn 12452 . . . . . . . . 9 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
5251adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
53 1cnd 11169 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 1 ∈ ℂ)
54 add32r 11394 . . . . . . . 8 ((𝑁 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5550, 52, 53, 54syl3anc 1373 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5655oveq1d 7402 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + (𝑘 + 1))C(𝑘 + 1)) = (((𝑁 + 1) + 𝑘)C(𝑘 + 1)))
5756oveq2d 7403 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5848, 57eqtrd 2764 . . . 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 7394 . . . 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 11126 . . . . . . . . 9 1 ∈ ℂ
63 pncan 11427 . . . . . . . . 9 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
6452, 62, 63sylancl 586 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
6564oveq2d 7403 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1)) = (((𝑁 + 1) + 𝑘)C𝑘))
6665oveq2d 7403 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)))
67 nn0addcl 12477 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
6829, 67sylan 580 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
69 nn0p1nn 12481 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
7069adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
7170nnzd 12556 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℤ)
72 bcpasc 14286 . . . . . . 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 2766 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
75 nn0p1nn 12481 . . . . . . . . . 10 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
76 nnnn0addcl 12472 . . . . . . . . . 10 (((𝑁 + 1) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7775, 76sylan 580 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7877nnnn0d 12503 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
79 bccl 14287 . . . . . . . 8 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8078, 71, 79syl2anc 584 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8180nn0cnd 12505 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℂ)
82 nn0z 12554 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℤ)
8382adantl 481 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
84 bccl 14287 . . . . . . . . 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 12505 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℂ)
8881, 87addcomd 11376 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
89 peano2cn 11346 . . . . . . . . 9 (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ)
9049, 89syl 17 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
9190adantr 480 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + 1) ∈ ℂ)
9291, 52, 53addassd 11196 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘) + 1) = ((𝑁 + 1) + (𝑘 + 1)))
9392oveq1d 7402 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9474, 88, 933eqtr3d 2772 . . . 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 2771 . 2 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
974, 8, 12, 16, 34, 96nn0indd 12631 1 ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  cfv 6511  (class class class)co 7387  cc 11066  0cc0 11068  1c1 11069   + caddc 11071  cmin 11405  cn 12186  0cn0 12442  cz 12529  cuz 12793  ...cfz 13468  Ccbc 14267  Σcsu 15652
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 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145  ax-pre-sup 11146
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-sup 9393  df-oi 9463  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-div 11836  df-nn 12187  df-2 12249  df-3 12250  df-n0 12443  df-z 12530  df-uz 12794  df-rp 12952  df-fz 13469  df-fzo 13616  df-seq 13967  df-exp 14027  df-fac 14239  df-bc 14268  df-hash 14296  df-cj 15065  df-re 15066  df-im 15067  df-sqrt 15201  df-abs 15202  df-clim 15454  df-sum 15653
This theorem is referenced by:  arisum  15826
  Copyright terms: Public domain W3C validator