| Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 5bc2eq10 | Structured version Visualization version GIF version | ||
| Description: The value of 5 choose 2. (Contributed by metakunt, 8-Jun-2024.) |
| Ref | Expression |
|---|---|
| 5bc2eq10 | ⊢ (5C2) = ;10 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 4nn0 12665 | . . . . 5 ⊢ 4 ∈ ℕ0 | |
| 2 | 2z 12768 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 3 | bcpasc 14506 | . . . . 5 ⊢ ((4 ∈ ℕ0 ∧ 2 ∈ ℤ) → ((4C2) + (4C(2 − 1))) = ((4 + 1)C2)) | |
| 4 | 1, 2, 3 | mp2an 705 | . . . 4 ⊢ ((4C2) + (4C(2 − 1))) = ((4 + 1)C2) |
| 5 | 4p1e5 12528 | . . . . 5 ⊢ (4 + 1) = 5 | |
| 6 | 5 | oveq1i 7461 | . . . 4 ⊢ ((4 + 1)C2) = (5C2) |
| 7 | 4, 6 | eqtri 2786 | . . 3 ⊢ ((4C2) + (4C(2 − 1))) = (5C2) |
| 8 | 7 | eqcomi 2772 | . 2 ⊢ (5C2) = ((4C2) + (4C(2 − 1))) |
| 9 | 2m1e1 12507 | . . . . 5 ⊢ (2 − 1) = 1 | |
| 10 | 9 | oveq2i 7462 | . . . 4 ⊢ (4C(2 − 1)) = (4C1) |
| 11 | 10 | oveq2i 7462 | . . 3 ⊢ ((4C2) + (4C(2 − 1))) = ((4C2) + (4C1)) |
| 12 | 4bc2eq6 14514 | . . . 4 ⊢ (4C2) = 6 | |
| 13 | bcn1 14498 | . . . . 5 ⊢ (4 ∈ ℕ0 → (4C1) = 4) | |
| 14 | 1, 13 | ax-mp 5 | . . . 4 ⊢ (4C1) = 4 |
| 15 | 12, 14 | oveq12i 7463 | . . 3 ⊢ ((4C2) + (4C1)) = (6 + 4) |
| 16 | 11, 15 | eqtri 2786 | . 2 ⊢ ((4C2) + (4C(2 − 1))) = (6 + 4) |
| 17 | 6p4e10 12931 | . 2 ⊢ (6 + 4) = ;10 | |
| 18 | 8, 16, 17 | 3eqtri 2790 | 1 ⊢ (5C2) = ;10 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 (class class class)co 7451 0cc0 11239 1c1 11240 + caddc 11242 − cmin 11580 2c2 12437 4c4 12439 5c5 12440 6c6 12441 ℕ0cn0 12646 ℤcz 12733 ;cdc 12854 Ccbc 14487 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-rp 13161 df-fz 13680 df-seq 14185 df-fac 14459 df-bc 14488 |
| This theorem is used by: 2ap1caineq 43461 |
| Copyright terms: Public domain | W3C validator |