HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem mapcdaen 4904
Description: Sum of exponents law for cardinal arithmetic. Theorem 6I(4) of [Enderton] p. 142.
Hypotheses
Ref Expression
cdacomen.1 |- A e. V
cdacomen.2 |- B e. V
cdaassen.3 |- C e. V
Assertion
Ref Expression
mapcdaen |- (A ^m (B +c C)) ~~ ((A ^m B) X. (A ^m C))

Proof of Theorem mapcdaen
StepHypRef Expression
1 cdacomen.2 . . . 4 |- B e. V
2 cdaassen.3 . . . 4 |- C e. V
31, 2cdaval 4892 . . 3 |- (B +c C) = ((B X. {(/)}) u. (C X. {1o}))
43opreq2i 3957 . 2 |- (A ^m (B +c C)) = (A ^m ((B X. {(/)}) u. (C X. {1o})))
5 xp01disj 4127 . . . 4 |- ((B X. {(/)}) i^i (C X. {1o})) = (/)
6 p0ex 2760 . . . . . 6 |- {(/)} e. V
71, 6xpex 3250 . . . . 5 |- (B X. {(/)}) e. V
8 snex 2740 . . . . . 6 |- {1o} e. V
92, 8xpex 3250 . . . . 5 |- (C X. {1o}) e. V
10 cdacomen.1 . . . . 5 |- A e. V
117, 9, 10mapunen 4482 . . . 4 |- (((B X. {(/)}) i^i (C X. {1o})) = (/) -> (A ^m ((B X. {(/)}) u. (C X. {1o}))) ~~ ((A ^m (B X. {(/)})) X. (A ^m (C X. {1o}))))
125, 11ax-mp 7 . . 3 |- (A ^m ((B X. {(/)}) u. (C X. {1o}))) ~~ ((A ^m (B X. {(/)})) X. (A ^m (C X. {1o})))
1310enref 4372 . . . . 5 |- A ~~ A
14 0ex 2701 . . . . . 6 |- (/) e. V
151, 14xpsnen 4415 . . . . 5 |- (B X. {(/)}) ~~ B
1610, 10, 7, 1mapen 4471 . . . . 5 |- ((A ~~ A /\ (B X. {(/)}) ~~ B) -> (A ^m (B X. {(/)})) ~~ (A ^m B))
1713, 15, 16mp2an 695 . . . 4 |- (A ^m (B X. {(/)})) ~~ (A ^m B)
18 1on 4122 . . . . . . 7 |- 1o e. On
1918elisseti 1809 . . . . . 6 |- 1o e. V
202, 19xpsnen 4415 . . . . 5 |- (C X. {1o}) ~~ C
2110, 10, 9, 2mapen 4471 . . . . 5 |- ((A ~~ A /\ (C X. {1o}) ~~ C) -> (A ^m (C X. {1o})) ~~ (A ^m C))
2213, 20, 21mp2an 695 . . . 4 |- (A ^m (C X. {1o})) ~~ (A ^m C)
23 oprex 3968 . . . . 5 |- (A ^m (B X. {(/)})) e. V
24 oprex 3968 . . . . 5 |- (A ^m B) e. V
25 oprex 3968 . . . . 5 |- (A ^m (C X. {1o})) e. V
26 oprex 3968 . . . . 5 |- (A ^m C) e. V
2723, 24, 25, 26xpen 4468 . . . 4 |- (((A ^m (B X. {(/)})) ~~ (A ^m B) /\ (A ^m (C X. {1o})) ~~ (A ^m C)) -> ((A ^m (B X. {(/)})) X. (A ^m (C X. {1o}))) ~~ ((A ^m B) X. (A ^m C)))
2817, 22, 27mp2an 695 . . 3 |- ((A ^m (B X. {(/)})) X. (A ^m (C X. {1o}))) ~~ ((A ^m B) X. (A ^m C))
2912, 28entr 4397 . 2 |- (A ^m ((B X. {(/)}) u. (C X. {1o}))) ~~ ((A ^m B) X. (A ^m C))
304, 29eqbrtr 2624 1 |- (A ^m (B +c C)) ~~ ((A ^m B) X. (A ^m C))
Colors of variables: wff set class
Syntax hints:   = wceq 953   e. wcel 955  Vcvv 1802   u. cun 2035   i^i cin 2036  (/)c0 2270  {csn 2399   class class class wbr 2609  Oncon0 2938   X. cxp 3158  (class class class)co 3948  1oc1o 4112   ^m cm 4306   ~~ cen 4348   +c ccda 4889
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-v 1803  df-sbc 1932  df-csb 1992  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-int 2524  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-id 2824  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-suc 2944  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-fun 3182  df-fn 3183  df-f 3184  df-f1 3185  df-fo 3186  df-f1o 3187  df-fv 3188  df-opr 3950  df-oprab 3951  df-1o 4117  df-er 4245  df-map 4308  df-en 4351  df-dom 4352  df-cda 4890
Copyright terms: Public domain