Theorem xpwdomg 9521

Description: Weak dominance of a Cartesian product. (Contributed by Stefan O'Rear, 13-Feb-2015.) (Revised by Mario Carneiro, 25-Jun-2015.)

Assertion

Ref	Expression
xpwdomg	⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))

Proof of Theorem xpwdomg

Dummy variables 𝑎 𝑏 𝑐 𝑓 𝑔 𝑥 𝑦 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brwdom3i 9519	. . 3 ⊢ (𝐴 ≼* 𝐵 → ∃𝑓∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏))
2	1	adantr 481	. 2 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → ∃𝑓∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏))
3		brwdom3i 9519	. . 3 ⊢ (𝐶 ≼* 𝐷 → ∃𝑔∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))
4	3	adantl 482	. 2 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → ∃𝑔∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))
5		relwdom 9502	. . . . . . . . . 10 ⊢ Rel ≼*
6	5	brrelex1i 5688	. . . . . . . . 9 ⊢ (𝐴 ≼* 𝐵 → 𝐴 ∈ V)
7	5	brrelex1i 5688	. . . . . . . . 9 ⊢ (𝐶 ≼* 𝐷 → 𝐶 ∈ V)
8		xpexg 7684	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 × 𝐶) ∈ V)
9	6, 7, 8	syl2an 596	. . . . . . . 8 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐴 × 𝐶) ∈ V)
10	9	adantr 481	. . . . . . 7 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))) → (𝐴 × 𝐶) ∈ V)
11	5	brrelex2i 5689	. . . . . . . . 9 ⊢ (𝐴 ≼* 𝐵 → 𝐵 ∈ V)
12	5	brrelex2i 5689	. . . . . . . . 9 ⊢ (𝐶 ≼* 𝐷 → 𝐷 ∈ V)
13		xpexg 7684	. . . . . . . . 9 ⊢ ((𝐵 ∈ V ∧ 𝐷 ∈ V) → (𝐵 × 𝐷) ∈ V)
14	11, 12, 13	syl2an 596	. . . . . . . 8 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐵 × 𝐷) ∈ V)
15	14	adantr 481	. . . . . . 7 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))) → (𝐵 × 𝐷) ∈ V)
16		pm3.2 470	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → (∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))))
17	16	ralimdv 3166	. . . . . . . . . . . . . . 15 ⊢ (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → (∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → ∀𝑐 ∈ 𝐶 (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))))
18	17	com12 32	. . . . . . . . . . . . . 14 ⊢ (∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → ∀𝑐 ∈ 𝐶 (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))))
19	18	ralimdv 3166	. . . . . . . . . . . . 13 ⊢ (∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))))
20	19	impcom 408	. . . . . . . . . . . 12 ⊢ ((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)))
21		pm3.2 470	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = (𝑓‘𝑏) → (𝑐 = (𝑔‘𝑑) → (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
22	21	reximdv 3167	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = (𝑓‘𝑏) → (∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
23	22	com12 32	. . . . . . . . . . . . . . 15 ⊢ (∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (𝑎 = (𝑓‘𝑏) → ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
24	23	reximdv 3167	. . . . . . . . . . . . . 14 ⊢ (∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
25	24	impcom 408	. . . . . . . . . . . . 13 ⊢ ((∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) → ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑)))
26	25	2ralimi 3126	. . . . . . . . . . . 12 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑)))
27	20, 26	syl 17	. . . . . . . . . . 11 ⊢ ((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) → ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑)))
28		eqeq1 2740	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ⟨𝑎, 𝑐⟩ → (𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩ ↔ ⟨𝑎, 𝑐⟩ = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩))
29		vex 3449	. . . . . . . . . . . . . . 15 ⊢ 𝑎 ∈ V
30		vex 3449	. . . . . . . . . . . . . . 15 ⊢ 𝑐 ∈ V
31	29, 30	opth 5433	. . . . . . . . . . . . . 14 ⊢ (⟨𝑎, 𝑐⟩ = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩ ↔ (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑)))
32	28, 31	bitrdi 286	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝑎, 𝑐⟩ → (𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩ ↔ (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
33	32	2rexbidv 3213	. . . . . . . . . . . 12 ⊢ (𝑥 = ⟨𝑎, 𝑐⟩ → (∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩ ↔ ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑))))
34	33	ralxp 5797	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ (𝐴 × 𝐶)∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩ ↔ ∀𝑎 ∈ 𝐴 ∀𝑐 ∈ 𝐶 ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 (𝑎 = (𝑓‘𝑏) ∧ 𝑐 = (𝑔‘𝑑)))
35	27, 34	sylibr 233	. . . . . . . . . 10 ⊢ ((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) → ∀𝑥 ∈ (𝐴 × 𝐶)∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩)
36	35	r19.21bi 3234	. . . . . . . . 9 ⊢ (((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩)
37		vex 3449	. . . . . . . . . . . . . 14 ⊢ 𝑏 ∈ V
38		vex 3449	. . . . . . . . . . . . . 14 ⊢ 𝑑 ∈ V
39	37, 38	op1std 7931	. . . . . . . . . . . . 13 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → (1st ‘𝑦) = 𝑏)
40	39	fveq2d 6846	. . . . . . . . . . . 12 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑓‘(1st ‘𝑦)) = (𝑓‘𝑏))
41	37, 38	op2ndd 7932	. . . . . . . . . . . . 13 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → (2nd ‘𝑦) = 𝑑)
42	41	fveq2d 6846	. . . . . . . . . . . 12 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑔‘(2nd ‘𝑦)) = (𝑔‘𝑑))
43	40, 42	opeq12d 4838	. . . . . . . . . . 11 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → ⟨(𝑓‘(1st ‘𝑦)), (𝑔‘(2nd ‘𝑦))⟩ = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩)
44	43	eqeq2d 2747	. . . . . . . . . 10 ⊢ (𝑦 = ⟨𝑏, 𝑑⟩ → (𝑥 = ⟨(𝑓‘(1st ‘𝑦)), (𝑔‘(2nd ‘𝑦))⟩ ↔ 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩))
45	44	rexxp 5798	. . . . . . . . 9 ⊢ (∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st ‘𝑦)), (𝑔‘(2nd ‘𝑦))⟩ ↔ ∃𝑏 ∈ 𝐵 ∃𝑑 ∈ 𝐷 𝑥 = ⟨(𝑓‘𝑏), (𝑔‘𝑑)⟩)
46	36, 45	sylibr 233	. . . . . . . 8 ⊢ (((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑)) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st ‘𝑦)), (𝑔‘(2nd ‘𝑦))⟩)
47	46	adantll 712	. . . . . . 7 ⊢ ((((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))) ∧ 𝑥 ∈ (𝐴 × 𝐶)) → ∃𝑦 ∈ (𝐵 × 𝐷)𝑥 = ⟨(𝑓‘(1st ‘𝑦)), (𝑔‘(2nd ‘𝑦))⟩)
48	10, 15, 47	wdom2d 9516	. . . . . 6 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑))) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))
49	48	expr 457	. . . . 5 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → (∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷)))
50	49	exlimdv 1936	. . . 4 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → (∃𝑔∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷)))
51	50	ex 413	. . 3 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → (∃𝑔∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))))
52	51	exlimdv 1936	. 2 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (∃𝑓∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) → (∃𝑔∀𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 𝑐 = (𝑔‘𝑑) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))))
53	2, 4, 52	mp2d 49	1 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐴 × 𝐶) ≼* (𝐵 × 𝐷))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  Vcvv 3445  ⟨cop 4592   class class class wbr 5105   × cxp 5631  ‘cfv 6496  1^st c1st 7919  2^nd c2nd 7920   ≼^* cwdom 9500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-1st 7921  df-2nd 7922  df-en 8884  df-dom 8885  df-sdom 8886  df-wdom 9501

This theorem is referenced by:  hsmexlem3  10364