Theorem xpdom2 9084

Description: Dominance law for Cartesian product. Proposition 10.33(2) of [TakeutiZaring] p. 92. (Contributed by NM, 24-Jul-2004.) (Revised by Mario Carneiro, 15-Nov-2014.)

Hypothesis

Ref	Expression
xpdom.2	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
xpdom2	⊢ (𝐴 ≼ 𝐵 → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵))

Proof of Theorem xpdom2

Dummy variables 𝑢 𝑓 𝑣 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 8979	. 2 ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵)
2		f1f 6776	. . . . . . . 8 ⊢ (𝑓:𝐴–1-1→𝐵 → 𝑓:𝐴⟶𝐵)
3		ffvelcdm 7079	. . . . . . . . 9 ⊢ ((𝑓:𝐴⟶𝐵 ∧ ∪ ran {𝑥} ∈ 𝐴) → (𝑓‘∪ ran {𝑥}) ∈ 𝐵)
4	3	ex 418	. . . . . . . 8 ⊢ (𝑓:𝐴⟶𝐵 → (∪ ran {𝑥} ∈ 𝐴 → (𝑓‘∪ ran {𝑥}) ∈ 𝐵))
5	2, 4	syl 18	. . . . . . 7 ⊢ (𝑓:𝐴–1-1→𝐵 → (∪ ran {𝑥} ∈ 𝐴 → (𝑓‘∪ ran {𝑥}) ∈ 𝐵))
6	5	anim2d 624	. . . . . 6 ⊢ (𝑓:𝐴–1-1→𝐵 → ((∪ dom {𝑥} ∈ 𝐶 ∧ ∪ ran {𝑥} ∈ 𝐴) → (∪ dom {𝑥} ∈ 𝐶 ∧ (𝑓‘∪ ran {𝑥}) ∈ 𝐵)))
7	6	adantld 496	. . . . 5 ⊢ (𝑓:𝐴–1-1→𝐵 → ((𝑥 = ⟨∪ dom {𝑥}, ∪ ran {𝑥}⟩ ∧ (∪ dom {𝑥} ∈ 𝐶 ∧ ∪ ran {𝑥} ∈ 𝐴)) → (∪ dom {𝑥} ∈ 𝐶 ∧ (𝑓‘∪ ran {𝑥}) ∈ 𝐵)))
8		elxp4 7932	. . . . 5 ⊢ (𝑥 ∈ (𝐶 × 𝐴) ↔ (𝑥 = ⟨∪ dom {𝑥}, ∪ ran {𝑥}⟩ ∧ (∪ dom {𝑥} ∈ 𝐶 ∧ ∪ ran {𝑥} ∈ 𝐴)))
9		opelxp 5687	. . . . 5 ⊢ (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ ∈ (𝐶 × 𝐵) ↔ (∪ dom {𝑥} ∈ 𝐶 ∧ (𝑓‘∪ ran {𝑥}) ∈ 𝐵))
10	7, 8, 9	3imtr4g 299	. . . 4 ⊢ (𝑓:𝐴–1-1→𝐵 → (𝑥 ∈ (𝐶 × 𝐴) → ⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ ∈ (𝐶 × 𝐵)))
11	10	adantl 487	. . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝑓:𝐴–1-1→𝐵) → (𝑥 ∈ (𝐶 × 𝐴) → ⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ ∈ (𝐶 × 𝐵)))
12		elxp2 5675	. . . . . 6 ⊢ (𝑥 ∈ (𝐶 × 𝐴) ↔ ∃𝑧 ∈ 𝐶 ∃𝑤 ∈ 𝐴 𝑥 = ⟨𝑧, 𝑤⟩)
13		elxp2 5675	. . . . . 6 ⊢ (𝑦 ∈ (𝐶 × 𝐴) ↔ ∃𝑣 ∈ 𝐶 ∃𝑢 ∈ 𝐴 𝑦 = ⟨𝑣, 𝑢⟩)
14		vex 3455	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑧 ∈ V
15		fvex 6896	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓‘𝑤) ∈ V
16	14, 15	opth 5445	. . . . . . . . . . . . . . . . 17 ⊢ (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ (𝑓‘𝑤) = (𝑓‘𝑢)))
17		f1fveq 7264	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓:𝐴–1-1→𝐵 ∧ (𝑤 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴)) → ((𝑓‘𝑤) = (𝑓‘𝑢) ↔ 𝑤 = 𝑢))
18	17	ancoms 464	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑤 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→𝐵) → ((𝑓‘𝑤) = (𝑓‘𝑢) ↔ 𝑤 = 𝑢))
19	18	anbi2d 642	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑤 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→𝐵) → ((𝑧 = 𝑣 ∧ (𝑓‘𝑤) = (𝑓‘𝑢)) ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
20	16, 19	bitrid 286	. . . . . . . . . . . . . . . 16 ⊢ (((𝑤 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→𝐵) → (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
21	20	ex 418	. . . . . . . . . . . . . . 15 ⊢ ((𝑤 ∈ 𝐴 ∧ 𝑢 ∈ 𝐴) → (𝑓:𝐴–1-1→𝐵 → (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢))))
22	21	ad2ant2l 759	. . . . . . . . . . . . . 14 ⊢ (((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) → (𝑓:𝐴–1-1→𝐵 → (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢))))
23	22	imp 412	. . . . . . . . . . . . 13 ⊢ ((((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) ∧ 𝑓:𝐴–1-1→𝐵) → (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
24	23	adantlr 728	. . . . . . . . . . . 12 ⊢ (((((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) ∧ (𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)) ∧ 𝑓:𝐴–1-1→𝐵) → (⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
25		sneq 4594	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → {𝑥} = {⟨𝑧, 𝑤⟩})
26	25	dmeqd 5887	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → dom {𝑥} = dom {⟨𝑧, 𝑤⟩})
27	26	unieqd 4880	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ∪ dom {𝑥} = ∪ dom {⟨𝑧, 𝑤⟩})
28		vex 3455	. . . . . . . . . . . . . . . . 17 ⊢ 𝑤 ∈ V
29	14, 28	op1sta 6225	. . . . . . . . . . . . . . . 16 ⊢ ∪ dom {⟨𝑧, 𝑤⟩} = 𝑧
30	27, 29	eqtrdi 2812	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ∪ dom {𝑥} = 𝑧)
31	25	rneqd 5920	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ran {𝑥} = ran {⟨𝑧, 𝑤⟩})
32	31	unieqd 4880	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ∪ ran {𝑥} = ∪ ran {⟨𝑧, 𝑤⟩})
33	14, 28	op2nda 6228	. . . . . . . . . . . . . . . . 17 ⊢ ∪ ran {⟨𝑧, 𝑤⟩} = 𝑤
34	32, 33	eqtrdi 2812	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ∪ ran {𝑥} = 𝑤)
35	34	fveq2d 6887	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → (𝑓‘∪ ran {𝑥}) = (𝑓‘𝑤))
36	30, 35	opeq12d 4841	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ⟨𝑧, 𝑤⟩ → ⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨𝑧, (𝑓‘𝑤)⟩)
37		sneq 4594	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → {𝑦} = {⟨𝑣, 𝑢⟩})
38	37	dmeqd 5887	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → dom {𝑦} = dom {⟨𝑣, 𝑢⟩})
39	38	unieqd 4880	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ∪ dom {𝑦} = ∪ dom {⟨𝑣, 𝑢⟩})
40		vex 3455	. . . . . . . . . . . . . . . . 17 ⊢ 𝑣 ∈ V
41		vex 3455	. . . . . . . . . . . . . . . . 17 ⊢ 𝑢 ∈ V
42	40, 41	op1sta 6225	. . . . . . . . . . . . . . . 16 ⊢ ∪ dom {⟨𝑣, 𝑢⟩} = 𝑣
43	39, 42	eqtrdi 2812	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ∪ dom {𝑦} = 𝑣)
44	37	rneqd 5920	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ran {𝑦} = ran {⟨𝑣, 𝑢⟩})
45	44	unieqd 4880	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ∪ ran {𝑦} = ∪ ran {⟨𝑣, 𝑢⟩})
46	40, 41	op2nda 6228	. . . . . . . . . . . . . . . . 17 ⊢ ∪ ran {⟨𝑣, 𝑢⟩} = 𝑢
47	45, 46	eqtrdi 2812	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ∪ ran {𝑦} = 𝑢)
48	47	fveq2d 6887	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → (𝑓‘∪ ran {𝑦}) = (𝑓‘𝑢))
49	43, 48	opeq12d 4841	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ⟨𝑣, 𝑢⟩ → ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ = ⟨𝑣, (𝑓‘𝑢)⟩)
50	36, 49	eqeqan12d 2775	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ ⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩))
51	50	ad2antlr 740	. . . . . . . . . . . 12 ⊢ (((((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) ∧ (𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)) ∧ 𝑓:𝐴–1-1→𝐵) → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ ⟨𝑧, (𝑓‘𝑤)⟩ = ⟨𝑣, (𝑓‘𝑢)⟩))
52		eqeq12 2778	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) → (𝑥 = 𝑦 ↔ ⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩))
53	14, 28	opth 5445	. . . . . . . . . . . . . 14 ⊢ (⟨𝑧, 𝑤⟩ = ⟨𝑣, 𝑢⟩ ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢))
54	52, 53	bitrdi 290	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) → (𝑥 = 𝑦 ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
55	54	ad2antlr 740	. . . . . . . . . . . 12 ⊢ (((((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) ∧ (𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)) ∧ 𝑓:𝐴–1-1→𝐵) → (𝑥 = 𝑦 ↔ (𝑧 = 𝑣 ∧ 𝑤 = 𝑢)))
56	24, 51, 55	3bitr4d 314	. . . . . . . . . . 11 ⊢ (((((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) ∧ (𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴)) ∧ (𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩)) ∧ 𝑓:𝐴–1-1→𝐵) → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦))
57	56	exp53 453	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) → ((𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴) → (𝑥 = ⟨𝑧, 𝑤⟩ → (𝑦 = ⟨𝑣, 𝑢⟩ → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦))))))
58	57	com23 87	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝐴) → (𝑥 = ⟨𝑧, 𝑤⟩ → ((𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴) → (𝑦 = ⟨𝑣, 𝑢⟩ → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦))))))
59	58	rexlimivv 3205	. . . . . . . 8 ⊢ (∃𝑧 ∈ 𝐶 ∃𝑤 ∈ 𝐴 𝑥 = ⟨𝑧, 𝑤⟩ → ((𝑣 ∈ 𝐶 ∧ 𝑢 ∈ 𝐴) → (𝑦 = ⟨𝑣, 𝑢⟩ → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦)))))
60	59	rexlimdvv 3219	. . . . . . 7 ⊢ (∃𝑧 ∈ 𝐶 ∃𝑤 ∈ 𝐴 𝑥 = ⟨𝑧, 𝑤⟩ → (∃𝑣 ∈ 𝐶 ∃𝑢 ∈ 𝐴 𝑦 = ⟨𝑣, 𝑢⟩ → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦))))
61	60	imp 412	. . . . . 6 ⊢ ((∃𝑧 ∈ 𝐶 ∃𝑤 ∈ 𝐴 𝑥 = ⟨𝑧, 𝑤⟩ ∧ ∃𝑣 ∈ 𝐶 ∃𝑢 ∈ 𝐴 𝑦 = ⟨𝑣, 𝑢⟩) → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦)))
62	12, 13, 61	syl2anb 610	. . . . 5 ⊢ ((𝑥 ∈ (𝐶 × 𝐴) ∧ 𝑦 ∈ (𝐶 × 𝐴)) → (𝑓:𝐴–1-1→𝐵 → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦)))
63	62	com12 33	. . . 4 ⊢ (𝑓:𝐴–1-1→𝐵 → ((𝑥 ∈ (𝐶 × 𝐴) ∧ 𝑦 ∈ (𝐶 × 𝐴)) → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦)))
64	63	adantl 487	. . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝑓:𝐴–1-1→𝐵) → ((𝑥 ∈ (𝐶 × 𝐴) ∧ 𝑦 ∈ (𝐶 × 𝐴)) → (⟨∪ dom {𝑥}, (𝑓‘∪ ran {𝑥})⟩ = ⟨∪ dom {𝑦}, (𝑓‘∪ ran {𝑦})⟩ ↔ 𝑥 = 𝑦)))
65		xpdom.2	. . . . 5 ⊢ 𝐶 ∈ V
66		reldom 8972	. . . . . 6 ⊢ Rel ≼
67	66	brrelex1i 5707	. . . . 5 ⊢ (𝐴 ≼ 𝐵 → 𝐴 ∈ V)
68		xpexg 7762	. . . . 5 ⊢ ((𝐶 ∈ V ∧ 𝐴 ∈ V) → (𝐶 × 𝐴) ∈ V)
69	65, 67, 68	sylancr 599	. . . 4 ⊢ (𝐴 ≼ 𝐵 → (𝐶 × 𝐴) ∈ V)
70	69	adantr 486	. . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝑓:𝐴–1-1→𝐵) → (𝐶 × 𝐴) ∈ V)
71	66	brrelex2i 5708	. . . . 5 ⊢ (𝐴 ≼ 𝐵 → 𝐵 ∈ V)
72		xpexg 7762	. . . . 5 ⊢ ((𝐶 ∈ V ∧ 𝐵 ∈ V) → (𝐶 × 𝐵) ∈ V)
73	65, 71, 72	sylancr 599	. . . 4 ⊢ (𝐴 ≼ 𝐵 → (𝐶 × 𝐵) ∈ V)
74	73	adantr 486	. . 3 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝑓:𝐴–1-1→𝐵) → (𝐶 × 𝐵) ∈ V)
75	11, 64, 70, 74	dom3d 9014	. 2 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝑓:𝐴–1-1→𝐵) → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵))
76	1, 75	exlimddv 1968	1 ⊢ (𝐴 ≼ 𝐵 → (𝐶 × 𝐴) ≼ (𝐶 × 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451  {csn 4584  ⟨cop 4590  ∪ cuni 4867   class class class wbr 5103   × cxp 5649  dom cdm 5651  ran crn 5652  ⟶wf 6533  –1-1→wf1 6534  ‘cfv 6537   ≼ cdom 8964

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fv 6545  df-dom 8968

This theorem is used by:  xpdom2g  9085  infxpenlem  10085  xpct  10088  djudom1  10254  cfpwsdom  10662  inar1  10853  rexpen  16389  2ndcctbss  23767  tx2ndc  23963  met2ndci  24834  mbfimaopnlem  25969