Metamath Proof Explorer


Theorem hashunlei

Description: Get an upper bound on a concretely specified finite set. Induction step: union of two finite bounded sets. (Contributed by Mario Carneiro, 11-Feb-2015)

Ref Expression
Hypotheses hashunlei.c C=AB
hashunlei.a AFinAK
hashunlei.b BFinBM
hashunlei.k K0
hashunlei.m M0
hashunlei.n K+M=N
Assertion hashunlei CFinCN

Proof

Step Hyp Ref Expression
1 hashunlei.c C=AB
2 hashunlei.a AFinAK
3 hashunlei.b BFinBM
4 hashunlei.k K0
5 hashunlei.m M0
6 hashunlei.n K+M=N
7 2 simpli AFin
8 3 simpli BFin
9 unfi AFinBFinABFin
10 7 8 9 mp2an ABFin
11 1 10 eqeltri CFin
12 1 fveq2i C=AB
13 hashun2 AFinBFinABA+B
14 7 8 13 mp2an ABA+B
15 12 14 eqbrtri CA+B
16 2 simpri AK
17 3 simpri BM
18 hashcl AFinA0
19 7 18 ax-mp A0
20 19 nn0rei A
21 hashcl BFinB0
22 8 21 ax-mp B0
23 22 nn0rei B
24 4 nn0rei K
25 5 nn0rei M
26 20 23 24 25 le2addi AKBMA+BK+M
27 16 17 26 mp2an A+BK+M
28 27 6 breqtri A+BN
29 hashcl CFinC0
30 11 29 ax-mp C0
31 30 nn0rei C
32 20 23 readdcli A+B
33 24 25 readdcli K+M
34 6 33 eqeltrri N
35 31 32 34 letri CA+BA+BNCN
36 15 28 35 mp2an CN
37 11 36 pm3.2i CFinCN