Theorem konigth

Description: Konig's Theorem. If m ( i ) ~< n ( i ) for all i e. A , then sum_ i e. A m ( i ) ~< prod_ i e. A n ( i ) , where the sums and products stand in for disjoint union and infinite cartesian product. The version here is proven with unions rather than disjoint unions for convenience, but the version with disjoint unions is clearly a special case of this version. The Axiom of Choice is needed for this proof, but it contains AC as a simple corollary (letting m ( i ) = (/) , this theorem says that an infinite cartesian product of nonempty sets is nonempty), so this is an AC equivalent. Theorem 11.26 of TakeutiZaring p. 107. (Contributed by Mario Carneiro, 22-Feb-2013)

	Ref	Expression
Hypotheses	konigth.1	|- A e. _V
	konigth.2	|- S = U_ i e. A ( M ` i )
	konigth.3	|- P = X_ i e. A ( N ` i )
Assertion	konigth	|- ( A. i e. A ( M ` i ) ~< ( N ` i ) -> S ~< P )

Proof

Step	Hyp	Ref	Expression
1		konigth.1	|- A e. _V
2		konigth.2	|- S = U_ i e. A ( M ` i )
3		konigth.3	|- P = X_ i e. A ( N ` i )
4		fveq2	|- ( b = a -> ( f ` b ) = ( f ` a ) )
5	4	fveq1d	|- ( b = a -> ( ( f ` b ) ` i ) = ( ( f ` a ) ` i ) )
6	5	cbvmptv	|- ( b e. ( M ` i ) |-> ( ( f ` b ) ` i ) ) = ( a e. ( M ` i ) |-> ( ( f ` a ) ` i ) )
7	6	mpteq2i	|- ( i e. A |-> ( b e. ( M ` i ) |-> ( ( f ` b ) ` i ) ) ) = ( i e. A |-> ( a e. ( M ` i ) |-> ( ( f ` a ) ` i ) ) )
8		fveq2	|- ( j = i -> ( e ` j ) = ( e ` i ) )
9	8	cbvmptv	|- ( j e. A |-> ( e ` j ) ) = ( i e. A |-> ( e ` i ) )
10	1 2 3 7 9	konigthlem	|- ( A. i e. A ( M ` i ) ~< ( N ` i ) -> S ~< P )