Theorem unwdomg 8884

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

Assertion

Ref	Expression
unwdomg	⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷))

Proof of Theorem unwdomg

Dummy variables 𝑎 𝑏 𝑓 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brwdom3i 8883	. . 3 ⊢ (𝐴 ≼* 𝐵 → ∃𝑓∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏))
2	1	3ad2ant1 1124	. 2 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → ∃𝑓∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏))
3		brwdom3i 8883	. . . . 5 ⊢ (𝐶 ≼* 𝐷 → ∃𝑔∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))
4	3	3ad2ant2 1125	. . . 4 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → ∃𝑔∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))
5	4	adantr 481	. . 3 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → ∃𝑔∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))
6		relwdom 8866	. . . . . . . . . 10 ⊢ Rel ≼*
7	6	brrelex1i 5486	. . . . . . . . 9 ⊢ (𝐴 ≼* 𝐵 → 𝐴 ∈ V)
8	6	brrelex1i 5486	. . . . . . . . 9 ⊢ (𝐶 ≼* 𝐷 → 𝐶 ∈ V)
9		unexg 7320	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ∪ 𝐶) ∈ V)
10	7, 8, 9	syl2an 595	. . . . . . . 8 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐴 ∪ 𝐶) ∈ V)
11	10	3adant3 1123	. . . . . . 7 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ∈ V)
12	11	adantr 481	. . . . . 6 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) → (𝐴 ∪ 𝐶) ∈ V)
13	6	brrelex2i 5487	. . . . . . . . 9 ⊢ (𝐴 ≼* 𝐵 → 𝐵 ∈ V)
14	6	brrelex2i 5487	. . . . . . . . 9 ⊢ (𝐶 ≼* 𝐷 → 𝐷 ∈ V)
15		unexg 7320	. . . . . . . . 9 ⊢ ((𝐵 ∈ V ∧ 𝐷 ∈ V) → (𝐵 ∪ 𝐷) ∈ V)
16	13, 14, 15	syl2an 595	. . . . . . . 8 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷) → (𝐵 ∪ 𝐷) ∈ V)
17	16	3adant3 1123	. . . . . . 7 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐵 ∪ 𝐷) ∈ V)
18	17	adantr 481	. . . . . 6 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) → (𝐵 ∪ 𝐷) ∈ V)
19		elun 4041	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝐴 ∪ 𝐶) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐶))
20		eqeq1 2797	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑦 → (𝑎 = (𝑓‘𝑏) ↔ 𝑦 = (𝑓‘𝑏)))
21	20	rexbidv 3257	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝑦 → (∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ↔ ∃𝑏 ∈ 𝐵 𝑦 = (𝑓‘𝑏)))
22	21	rspcva 3552	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → ∃𝑏 ∈ 𝐵 𝑦 = (𝑓‘𝑏))
23		fveq2 6530	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑧 → (𝑓‘𝑏) = (𝑓‘𝑧))
24	23	eqeq2d 2803	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑧 → (𝑦 = (𝑓‘𝑏) ↔ 𝑦 = (𝑓‘𝑧)))
25	24	cbvrexv 3401	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑏 ∈ 𝐵 𝑦 = (𝑓‘𝑏) ↔ ∃𝑧 ∈ 𝐵 𝑦 = (𝑓‘𝑧))
26		ssun1 4064	. . . . . . . . . . . . . . . . 17 ⊢ 𝐵 ⊆ (𝐵 ∪ 𝐷)
27		iftrue 4381	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑧 ∈ 𝐵 → if(𝑧 ∈ 𝐵, 𝑓, 𝑔) = 𝑓)
28	27	fveq1d 6532	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 ∈ 𝐵 → (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) = (𝑓‘𝑧))
29	28	eqeq2d 2803	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 ∈ 𝐵 → (𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) ↔ 𝑦 = (𝑓‘𝑧)))
30	29	biimprd 249	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 ∈ 𝐵 → (𝑦 = (𝑓‘𝑧) → 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
31	30	reximia 3204	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑧 ∈ 𝐵 𝑦 = (𝑓‘𝑧) → ∃𝑧 ∈ 𝐵 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
32		ssrexv 3950	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ⊆ (𝐵 ∪ 𝐷) → (∃𝑧 ∈ 𝐵 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
33	26, 31, 32	mpsyl 68	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑧 ∈ 𝐵 𝑦 = (𝑓‘𝑧) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
34	25, 33	sylbi 218	. . . . . . . . . . . . . . 15 ⊢ (∃𝑏 ∈ 𝐵 𝑦 = (𝑓‘𝑏) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
35	22, 34	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
36	35	ancoms 459	. . . . . . . . . . . . 13 ⊢ ((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ 𝑦 ∈ 𝐴) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
37	36	adantlr 711	. . . . . . . . . . . 12 ⊢ (((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏)) ∧ 𝑦 ∈ 𝐴) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
38	37	adantll 710	. . . . . . . . . . 11 ⊢ ((((𝐵 ∩ 𝐷) = ∅ ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) ∧ 𝑦 ∈ 𝐴) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
39		eqeq1 2797	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 = 𝑦 → (𝑎 = (𝑔‘𝑏) ↔ 𝑦 = (𝑔‘𝑏)))
40	39	rexbidv 3257	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 = 𝑦 → (∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) ↔ ∃𝑏 ∈ 𝐷 𝑦 = (𝑔‘𝑏)))
41		fveq2 6530	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑧 → (𝑔‘𝑏) = (𝑔‘𝑧))
42	41	eqeq2d 2803	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑧 → (𝑦 = (𝑔‘𝑏) ↔ 𝑦 = (𝑔‘𝑧)))
43	42	cbvrexv 3401	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑏 ∈ 𝐷 𝑦 = (𝑔‘𝑏) ↔ ∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧))
44	40, 43	syl6bb 288	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝑦 → (∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) ↔ ∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧)))
45	44	rspccva 3553	. . . . . . . . . . . . . 14 ⊢ ((∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧))
46		ssun2 4065	. . . . . . . . . . . . . . 15 ⊢ 𝐷 ⊆ (𝐵 ∪ 𝐷)
47		minel 4323	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → ¬ 𝑧 ∈ 𝐵)
48	47	ancoms 459	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ 𝑧 ∈ 𝐷) → ¬ 𝑧 ∈ 𝐵)
49	48	iffalsed 4386	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ 𝑧 ∈ 𝐷) → if(𝑧 ∈ 𝐵, 𝑓, 𝑔) = 𝑔)
50	49	fveq1d 6532	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ 𝑧 ∈ 𝐷) → (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) = (𝑔‘𝑧))
51	50	eqeq2d 2803	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ 𝑧 ∈ 𝐷) → (𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) ↔ 𝑦 = (𝑔‘𝑧)))
52	51	biimprd 249	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ 𝑧 ∈ 𝐷) → (𝑦 = (𝑔‘𝑧) → 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
53	52	reximdva 3234	. . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∩ 𝐷) = ∅ → (∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧) → ∃𝑧 ∈ 𝐷 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
54	53	imp 407	. . . . . . . . . . . . . . 15 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ ∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧)) → ∃𝑧 ∈ 𝐷 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
55		ssrexv 3950	. . . . . . . . . . . . . . 15 ⊢ (𝐷 ⊆ (𝐵 ∪ 𝐷) → (∃𝑧 ∈ 𝐷 𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
56	46, 54, 55	mpsyl 68	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ ∃𝑧 ∈ 𝐷 𝑦 = (𝑔‘𝑧)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
57	45, 56	sylan2 592	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∩ 𝐷) = ∅ ∧ (∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) ∧ 𝑦 ∈ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
58	57	anassrs 468	. . . . . . . . . . . 12 ⊢ ((((𝐵 ∩ 𝐷) = ∅ ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏)) ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
59	58	adantlrl 716	. . . . . . . . . . 11 ⊢ ((((𝐵 ∩ 𝐷) = ∅ ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) ∧ 𝑦 ∈ 𝐶) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
60	38, 59	jaodan 950	. . . . . . . . . 10 ⊢ ((((𝐵 ∩ 𝐷) = ∅ ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) ∧ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
61	19, 60	sylan2b 593	. . . . . . . . 9 ⊢ ((((𝐵 ∩ 𝐷) = ∅ ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
62	61	expl 458	. . . . . . . 8 ⊢ ((𝐵 ∩ 𝐷) = ∅ → (((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏)) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
63	62	3ad2ant3 1126	. . . . . . 7 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → (((∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏)) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧)))
64	63	impl 456	. . . . . 6 ⊢ ((((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) ∧ 𝑦 ∈ (𝐴 ∪ 𝐶)) → ∃𝑧 ∈ (𝐵 ∪ 𝐷)𝑦 = (if(𝑧 ∈ 𝐵, 𝑓, 𝑔)‘𝑧))
65	12, 18, 64	wdom2d 8880	. . . . 5 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏) ∧ ∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏))) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷))
66	65	expr 457	. . . 4 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → (∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷)))
67	66	exlimdv 1909	. . 3 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → (∃𝑔∀𝑎 ∈ 𝐶 ∃𝑏 ∈ 𝐷 𝑎 = (𝑔‘𝑏) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷)))
68	5, 67	mpd 15	. 2 ⊢ (((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 = (𝑓‘𝑏)) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷))
69	2, 68	exlimddv 1911	1 ⊢ ((𝐴 ≼* 𝐵 ∧ 𝐶 ≼* 𝐷 ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐴 ∪ 𝐶) ≼* (𝐵 ∪ 𝐷))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∨ wo 842   ∧ w3a 1078   = wceq 1520  ∃wex 1759   ∈ wcel 2079  ∀wral 3103  ∃wrex 3104  Vcvv 3432   ∪ cun 3852   ∩ cin 3853   ⊆ wss 3854  ∅c0 4206  ifcif 4375   class class class wbr 4956  ‘cfv 6217   ≼^* cwdom 8857

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1775  ax-4 1789  ax-5 1886  ax-6 1945  ax-7 1990  ax-8 2081  ax-9 2089  ax-10 2110  ax-11 2124  ax-12 2139  ax-13 2342  ax-ext 2767  ax-sep 5088  ax-nul 5095  ax-pow 5150  ax-pr 5214  ax-un 7310

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1080  df-tru 1523  df-ex 1760  df-nf 1764  df-sb 2041  df-mo 2574  df-eu 2610  df-clab 2774  df-cleq 2786  df-clel 2861  df-nfc 2933  df-ne 2983  df-ral 3108  df-rex 3109  df-rab 3112  df-v 3434  df-sbc 3702  df-csb 3807  df-dif 3857  df-un 3859  df-in 3861  df-ss 3869  df-nul 4207  df-if 4376  df-pw 4449  df-sn 4467  df-pr 4469  df-op 4473  df-uni 4740  df-br 4957  df-opab 5019  df-mpt 5036  df-id 5340  df-xp 5441  df-rel 5442  df-cnv 5443  df-co 5444  df-dm 5445  df-rn 5446  df-res 5447  df-ima 5448  df-iota 6181  df-fun 6219  df-fn 6220  df-f 6221  df-f1 6222  df-fo 6223  df-f1o 6224  df-fv 6225  df-er 8130  df-en 8348  df-dom 8349  df-sdom 8350  df-wdom 8859

This theorem is referenced by: (None)