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

Theorem bcxmas 15759
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 15758 . . 3 (𝑚 = 0 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 0)C0))
2 oveq2 7366 . . . 4 (𝑚 = 0 → (0...𝑚) = (0...0))
32sumeq1d 15624 . . 3 (𝑚 = 0 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
41, 3eqeq12d 2753 . 2 (𝑚 = 0 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗)))
5 bcxmaslem1 15758 . . 3 (𝑚 = 𝑘 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑘)C𝑘))
6 oveq2 7366 . . . 4 (𝑚 = 𝑘 → (0...𝑚) = (0...𝑘))
76sumeq1d 15624 . . 3 (𝑚 = 𝑘 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗))
85, 7eqeq12d 2753 . 2 (𝑚 = 𝑘 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)))
9 bcxmaslem1 15758 . . 3 (𝑚 = (𝑘 + 1) → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
10 oveq2 7366 . . . 4 (𝑚 = (𝑘 + 1) → (0...𝑚) = (0...(𝑘 + 1)))
1110sumeq1d 15624 . . 3 (𝑚 = (𝑘 + 1) → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
129, 11eqeq12d 2753 . 2 (𝑚 = (𝑘 + 1) → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗)))
13 bcxmaslem1 15758 . . 3 (𝑚 = 𝑀 → (((𝑁 + 1) + 𝑚)C𝑚) = (((𝑁 + 1) + 𝑀)C𝑀))
14 oveq2 7366 . . . 4 (𝑚 = 𝑀 → (0...𝑚) = (0...𝑀))
1514sumeq1d 15624 . . 3 (𝑚 = 𝑀 → Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
1613, 15eqeq12d 2753 . 2 (𝑚 = 𝑀 → ((((𝑁 + 1) + 𝑚)C𝑚) = Σ𝑗 ∈ (0...𝑚)((𝑁 + 𝑗)C𝑗) ↔ (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗)))
17 0nn0 12417 . . . 4 0 ∈ ℕ0
18 nn0addcl 12437 . . . . 5 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → (𝑁 + 0) ∈ ℕ0)
19 bcn0 14234 . . . . 5 ((𝑁 + 0) ∈ ℕ0 → ((𝑁 + 0)C0) = 1)
2018, 19syl 17 . . . 4 ((𝑁 ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 0)C0) = 1)
2117, 20mpan2 692 . . 3 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) = 1)
22 0z 12500 . . . 4 0 ∈ ℤ
23 1nn0 12418 . . . . . 6 1 ∈ ℕ0
2421, 23eqeltrdi 2845 . . . . 5 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℕ0)
2524nn0cnd 12465 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 0)C0) ∈ ℂ)
26 bcxmaslem1 15758 . . . . 5 (𝑗 = 0 → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2726fsum1 15671 . . . 4 ((0 ∈ ℤ ∧ ((𝑁 + 0)C0) ∈ ℂ) → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
2822, 25, 27sylancr 588 . . 3 (𝑁 ∈ ℕ0 → Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗) = ((𝑁 + 0)C0))
29 peano2nn0 12442 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
30 nn0addcl 12437 . . . . 5 (((𝑁 + 1) ∈ ℕ0 ∧ 0 ∈ ℕ0) → ((𝑁 + 1) + 0) ∈ ℕ0)
3129, 17, 30sylancl 587 . . . 4 (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 0) ∈ ℕ0)
32 bcn0 14234 . . . 4 (((𝑁 + 1) + 0) ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3331, 32syl 17 . . 3 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = 1)
3421, 28, 333eqtr4rd 2783 . 2 (𝑁 ∈ ℕ0 → (((𝑁 + 1) + 0)C0) = Σ𝑗 ∈ (0...0)((𝑁 + 𝑗)C𝑗))
35 simpr 484 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
36 elnn0uz 12793 . . . . . . 7 (𝑘 ∈ ℕ0𝑘 ∈ (ℤ‘0))
3735, 36sylib 218 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ (ℤ‘0))
38 simpl 482 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℕ0)
39 elfznn0 13537 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℕ0)
40 nn0addcl 12437 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑗 ∈ ℕ0) → (𝑁 + 𝑗) ∈ ℕ0)
4138, 39, 40syl2an 597 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → (𝑁 + 𝑗) ∈ ℕ0)
42 elfzelz 13441 . . . . . . . . 9 (𝑗 ∈ (0...(𝑘 + 1)) → 𝑗 ∈ ℤ)
4342adantl 481 . . . . . . . 8 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → 𝑗 ∈ ℤ)
44 bccl 14246 . . . . . . . 8 (((𝑁 + 𝑗) ∈ ℕ0𝑗 ∈ ℤ) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4541, 43, 44syl2anc 585 . . . . . . 7 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℕ0)
4645nn0cnd 12465 . . . . . 6 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ 𝑗 ∈ (0...(𝑘 + 1))) → ((𝑁 + 𝑗)C𝑗) ∈ ℂ)
47 bcxmaslem1 15758 . . . . . 6 (𝑗 = (𝑘 + 1) → ((𝑁 + 𝑗)C𝑗) = ((𝑁 + (𝑘 + 1))C(𝑘 + 1)))
4837, 46, 47fsump1 15680 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))))
49 nn0cn 12412 . . . . . . . . 9 (𝑁 ∈ ℕ0𝑁 ∈ ℂ)
5049adantr 480 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑁 ∈ ℂ)
51 nn0cn 12412 . . . . . . . . 9 (𝑘 ∈ ℕ0𝑘 ∈ ℂ)
5251adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℂ)
53 1cnd 11128 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → 1 ∈ ℂ)
54 add32r 11354 . . . . . . . 8 ((𝑁 ∈ ℂ ∧ 𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5550, 52, 53, 54syl3anc 1374 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + (𝑘 + 1)) = ((𝑁 + 1) + 𝑘))
5655oveq1d 7373 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + (𝑘 + 1))C(𝑘 + 1)) = (((𝑁 + 1) + 𝑘)C(𝑘 + 1)))
5756oveq2d 7374 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + ((𝑁 + (𝑘 + 1))C(𝑘 + 1))) = (Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
5848, 57eqtrd 2772 . . . 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 7365 . . . 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 11085 . . . . . . . . 9 1 ∈ ℂ
63 pncan 11387 . . . . . . . . 9 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
6452, 62, 63sylancl 587 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑘 + 1) − 1) = 𝑘)
6564oveq2d 7374 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1)) = (((𝑁 + 1) + 𝑘)C𝑘))
6665oveq2d 7374 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)))
67 nn0addcl 12437 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
6829, 67sylan 581 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
69 nn0p1nn 12441 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
7069adantl 481 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℕ)
7170nnzd 12515 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑘 + 1) ∈ ℤ)
72 bcpasc 14245 . . . . . . 7 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7368, 71, 72syl2anc 585 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C((𝑘 + 1) − 1))) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
7466, 73eqtr3d 2774 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)))
75 nn0p1nn 12441 . . . . . . . . . 10 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
76 nnnn0addcl 12432 . . . . . . . . . 10 (((𝑁 + 1) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7775, 76sylan 581 . . . . . . . . 9 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ)
7877nnnn0d 12463 . . . . . . . 8 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((𝑁 + 1) + 𝑘) ∈ ℕ0)
79 bccl 14246 . . . . . . . 8 ((((𝑁 + 1) + 𝑘) ∈ ℕ0 ∧ (𝑘 + 1) ∈ ℤ) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8078, 71, 79syl2anc 585 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℕ0)
8180nn0cnd 12465 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C(𝑘 + 1)) ∈ ℂ)
82 nn0z 12513 . . . . . . . . . 10 (𝑘 ∈ ℕ0𝑘 ∈ ℤ)
8382adantl 481 . . . . . . . . 9 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → 𝑘 ∈ ℤ)
84 bccl 14246 . . . . . . . . 9 ((((𝑁 + 1) + 𝑘) ∈ ℕ0𝑘 ∈ ℤ) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8567, 83, 84syl2anc 585 . . . . . . . 8 (((𝑁 + 1) ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8629, 85sylan 581 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℕ0)
8786nn0cnd 12465 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘)C𝑘) ∈ ℂ)
8881, 87addcomd 11336 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘)C(𝑘 + 1)) + (((𝑁 + 1) + 𝑘)C𝑘)) = ((((𝑁 + 1) + 𝑘)C𝑘) + (((𝑁 + 1) + 𝑘)C(𝑘 + 1))))
89 peano2cn 11306 . . . . . . . . 9 (𝑁 ∈ ℂ → (𝑁 + 1) ∈ ℂ)
9049, 89syl 17 . . . . . . . 8 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
9190adantr 480 . . . . . . 7 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (𝑁 + 1) ∈ ℂ)
9291, 52, 53addassd 11155 . . . . . 6 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → (((𝑁 + 1) + 𝑘) + 1) = ((𝑁 + 1) + (𝑘 + 1)))
9392oveq1d 7373 . . . . 5 ((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) → ((((𝑁 + 1) + 𝑘) + 1)C(𝑘 + 1)) = (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)))
9474, 88, 933eqtr3d 2780 . . . 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 2779 . 2 (((𝑁 ∈ ℕ0𝑘 ∈ ℕ0) ∧ (((𝑁 + 1) + 𝑘)C𝑘) = Σ𝑗 ∈ (0...𝑘)((𝑁 + 𝑗)C𝑗)) → (((𝑁 + 1) + (𝑘 + 1))C(𝑘 + 1)) = Σ𝑗 ∈ (0...(𝑘 + 1))((𝑁 + 𝑗)C𝑗))
974, 8, 12, 16, 34, 96nn0indd 12590 1 ((𝑁 ∈ ℕ0𝑀 ∈ ℕ0) → (((𝑁 + 1) + 𝑀)C𝑀) = Σ𝑗 ∈ (0...𝑀)((𝑁 + 𝑗)C𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cfv 6490  (class class class)co 7358  cc 11025  0cc0 11027  1c1 11028   + caddc 11030  cmin 11365  cn 12146  0cn0 12402  cz 12489  cuz 12752  ...cfz 13424  Ccbc 14226  Σcsu 15610
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-inf2 9551  ax-cnex 11083  ax-resscn 11084  ax-1cn 11085  ax-icn 11086  ax-addcl 11087  ax-addrcl 11088  ax-mulcl 11089  ax-mulrcl 11090  ax-mulcom 11091  ax-addass 11092  ax-mulass 11093  ax-distr 11094  ax-i2m1 11095  ax-1ne0 11096  ax-1rid 11097  ax-rnegex 11098  ax-rrecex 11099  ax-cnre 11100  ax-pre-lttri 11101  ax-pre-lttrn 11102  ax-pre-ltadd 11103  ax-pre-mulgt0 11104  ax-pre-sup 11105
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-isom 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-er 8634  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-sup 9346  df-oi 9416  df-card 9852  df-pnf 11169  df-mnf 11170  df-xr 11171  df-ltxr 11172  df-le 11173  df-sub 11367  df-neg 11368  df-div 11796  df-nn 12147  df-2 12209  df-3 12210  df-n0 12403  df-z 12490  df-uz 12753  df-rp 12907  df-fz 13425  df-fzo 13572  df-seq 13926  df-exp 13986  df-fac 14198  df-bc 14227  df-hash 14255  df-cj 15023  df-re 15024  df-im 15025  df-sqrt 15159  df-abs 15160  df-clim 15412  df-sum 15611
This theorem is referenced by:  arisum  15784
  Copyright terms: Public domain W3C validator