Metamath Proof Explorer


Theorem unxpwdom

Description: If a Cartesian product is dominated by a union, then the base set is either weakly dominated by one factor of the union or dominated by the other. Extracted from Lemma 2.3 of KanamoriPincus p. 420. (Contributed by Mario Carneiro, 15-May-2015)

Ref Expression
Assertion unxpwdom A × A B C A * B A C

Proof

Step Hyp Ref Expression
1 reldom Rel
2 1 brrelex2i A × A B C B C V
3 domeng B C V A × A B C x A × A x x B C
4 2 3 syl A × A B C A × A B C x A × A x x B C
5 4 ibi A × A B C x A × A x x B C
6 simprl A × A B C A × A x x B C A × A x
7 indi x B C = x B x C
8 simprr A × A B C A × A x x B C x B C
9 df-ss x B C x B C = x
10 8 9 sylib A × A B C A × A x x B C x B C = x
11 7 10 eqtr3id A × A B C A × A x x B C x B x C = x
12 6 11 breqtrrd A × A B C A × A x x B C A × A x B x C
13 unxpwdom2 A × A x B x C A * x B A x C
14 12 13 syl A × A B C A × A x x B C A * x B A x C
15 ssun1 B B C
16 2 adantr A × A B C A × A x x B C B C V
17 ssexg B B C B C V B V
18 15 16 17 sylancr A × A B C A × A x x B C B V
19 inss2 x B B
20 ssdomg B V x B B x B B
21 18 19 20 mpisyl A × A B C A × A x x B C x B B
22 domwdom x B B x B * B
23 21 22 syl A × A B C A × A x x B C x B * B
24 wdomtr A * x B x B * B A * B
25 24 expcom x B * B A * x B A * B
26 23 25 syl A × A B C A × A x x B C A * x B A * B
27 ssun2 C B C
28 ssexg C B C B C V C V
29 27 16 28 sylancr A × A B C A × A x x B C C V
30 inss2 x C C
31 ssdomg C V x C C x C C
32 29 30 31 mpisyl A × A B C A × A x x B C x C C
33 domtr A x C x C C A C
34 33 expcom x C C A x C A C
35 32 34 syl A × A B C A × A x x B C A x C A C
36 26 35 orim12d A × A B C A × A x x B C A * x B A x C A * B A C
37 14 36 mpd A × A B C A × A x x B C A * B A C
38 5 37 exlimddv A × A B C A * B A C