Theorem brwdom2 8769

Description: Alternate characterization of the weak dominance predicate which does not require special treatment of the empty set. (Contributed by Stefan O'Rear, 11-Feb-2015.)

Assertion

Ref	Expression
brwdom2	⊢ (𝑌 ∈ 𝑉 → (𝑋 ≼* 𝑌 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))

Distinct variable groups:   𝑦,𝑋,𝑧   𝑦,𝑌,𝑧

Allowed substitution hints:   𝑉(𝑦,𝑧)

Proof of Theorem brwdom2

Dummy variables 𝑥 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3414	. 2 ⊢ (𝑌 ∈ 𝑉 → 𝑌 ∈ V)
2		0wdom 8766	. . . . . 6 ⊢ (𝑌 ∈ V → ∅ ≼* 𝑌)
3		breq1 4891	. . . . . 6 ⊢ (𝑋 = ∅ → (𝑋 ≼* 𝑌 ↔ ∅ ≼* 𝑌))
4	2, 3	syl5ibrcom 239	. . . . 5 ⊢ (𝑌 ∈ V → (𝑋 = ∅ → 𝑋 ≼* 𝑌))
5	4	imp 397	. . . 4 ⊢ ((𝑌 ∈ V ∧ 𝑋 = ∅) → 𝑋 ≼* 𝑌)
6		0elpw 5070	. . . . . . 7 ⊢ ∅ ∈ 𝒫 𝑌
7		f1o0 6429	. . . . . . . 8 ⊢ ∅:∅–1-1-onto→∅
8		f1ofo 6400	. . . . . . . 8 ⊢ (∅:∅–1-1-onto→∅ → ∅:∅–onto→∅)
9		0ex 5028	. . . . . . . . 9 ⊢ ∅ ∈ V
10		foeq1 6364	. . . . . . . . 9 ⊢ (𝑧 = ∅ → (𝑧:∅–onto→∅ ↔ ∅:∅–onto→∅))
11	9, 10	spcev 3502	. . . . . . . 8 ⊢ (∅:∅–onto→∅ → ∃𝑧 𝑧:∅–onto→∅)
12	7, 8, 11	mp2b 10	. . . . . . 7 ⊢ ∃𝑧 𝑧:∅–onto→∅
13		foeq2 6365	. . . . . . . . 9 ⊢ (𝑦 = ∅ → (𝑧:𝑦–onto→∅ ↔ 𝑧:∅–onto→∅))
14	13	exbidv 1964	. . . . . . . 8 ⊢ (𝑦 = ∅ → (∃𝑧 𝑧:𝑦–onto→∅ ↔ ∃𝑧 𝑧:∅–onto→∅))
15	14	rspcev 3511	. . . . . . 7 ⊢ ((∅ ∈ 𝒫 𝑌 ∧ ∃𝑧 𝑧:∅–onto→∅) → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→∅)
16	6, 12, 15	mp2an 682	. . . . . 6 ⊢ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→∅
17		foeq3 6366	. . . . . . . 8 ⊢ (𝑋 = ∅ → (𝑧:𝑦–onto→𝑋 ↔ 𝑧:𝑦–onto→∅))
18	17	exbidv 1964	. . . . . . 7 ⊢ (𝑋 = ∅ → (∃𝑧 𝑧:𝑦–onto→𝑋 ↔ ∃𝑧 𝑧:𝑦–onto→∅))
19	18	rexbidv 3237	. . . . . 6 ⊢ (𝑋 = ∅ → (∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→∅))
20	16, 19	mpbiri 250	. . . . 5 ⊢ (𝑋 = ∅ → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋)
21	20	adantl 475	. . . 4 ⊢ ((𝑌 ∈ V ∧ 𝑋 = ∅) → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋)
22	5, 21	2thd 257	. . 3 ⊢ ((𝑌 ∈ V ∧ 𝑋 = ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
23		brwdomn0 8765	. . . . 5 ⊢ (𝑋 ≠ ∅ → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋))
24	23	adantl 475	. . . 4 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑥 𝑥:𝑌–onto→𝑋))
25		foeq1 6364	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥:𝑌–onto→𝑋 ↔ 𝑧:𝑌–onto→𝑋))
26	25	cbvexvw 2087	. . . . . 6 ⊢ (∃𝑥 𝑥:𝑌–onto→𝑋 ↔ ∃𝑧 𝑧:𝑌–onto→𝑋)
27		pwidg 4394	. . . . . . . . 9 ⊢ (𝑌 ∈ V → 𝑌 ∈ 𝒫 𝑌)
28	27	ad2antrr 716	. . . . . . . 8 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ ∃𝑧 𝑧:𝑌–onto→𝑋) → 𝑌 ∈ 𝒫 𝑌)
29		foeq2 6365	. . . . . . . . . 10 ⊢ (𝑦 = 𝑌 → (𝑧:𝑦–onto→𝑋 ↔ 𝑧:𝑌–onto→𝑋))
30	29	exbidv 1964	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (∃𝑧 𝑧:𝑦–onto→𝑋 ↔ ∃𝑧 𝑧:𝑌–onto→𝑋))
31	30	rspcev 3511	. . . . . . . 8 ⊢ ((𝑌 ∈ 𝒫 𝑌 ∧ ∃𝑧 𝑧:𝑌–onto→𝑋) → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋)
32	28, 31	sylancom 582	. . . . . . 7 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ ∃𝑧 𝑧:𝑌–onto→𝑋) → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋)
33	32	ex 403	. . . . . 6 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (∃𝑧 𝑧:𝑌–onto→𝑋 → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
34	26, 33	syl5bi 234	. . . . 5 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌–onto→𝑋 → ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
35		n0 4159	. . . . . . . . . . 11 ⊢ (𝑋 ≠ ∅ ↔ ∃𝑤 𝑤 ∈ 𝑋)
36	35	biimpi 208	. . . . . . . . . 10 ⊢ (𝑋 ≠ ∅ → ∃𝑤 𝑤 ∈ 𝑋)
37	36	ad2antlr 717	. . . . . . . . 9 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) → ∃𝑤 𝑤 ∈ 𝑋)
38		vex 3401	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
39		difexg 5047	. . . . . . . . . . . . . 14 ⊢ (𝑌 ∈ V → (𝑌 ∖ 𝑦) ∈ V)
40		snex 5142	. . . . . . . . . . . . . 14 ⊢ {𝑤} ∈ V
41		xpexg 7239	. . . . . . . . . . . . . 14 ⊢ (((𝑌 ∖ 𝑦) ∈ V ∧ {𝑤} ∈ V) → ((𝑌 ∖ 𝑦) × {𝑤}) ∈ V)
42	39, 40, 41	sylancl 580	. . . . . . . . . . . . 13 ⊢ (𝑌 ∈ V → ((𝑌 ∖ 𝑦) × {𝑤}) ∈ V)
43		unexg 7238	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ V ∧ ((𝑌 ∖ 𝑦) × {𝑤}) ∈ V) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) ∈ V)
44	38, 42, 43	sylancr 581	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ V → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) ∈ V)
45	44	adantr 474	. . . . . . . . . . 11 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) ∈ V)
46	45	ad2antrr 716	. . . . . . . . . 10 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) ∈ V)
47		fofn 6370	. . . . . . . . . . . . . . 15 ⊢ (𝑧:𝑦–onto→𝑋 → 𝑧 Fn 𝑦)
48	47	adantl 475	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋) → 𝑧 Fn 𝑦)
49	48	ad2antlr 717	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → 𝑧 Fn 𝑦)
50		vex 3401	. . . . . . . . . . . . . 14 ⊢ 𝑤 ∈ V
51		fnconstg 6345	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ V → ((𝑌 ∖ 𝑦) × {𝑤}) Fn (𝑌 ∖ 𝑦))
52	50, 51	mp1i 13	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ((𝑌 ∖ 𝑦) × {𝑤}) Fn (𝑌 ∖ 𝑦))
53		disjdif 4264	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∩ (𝑌 ∖ 𝑦)) = ∅
54	53	a1i 11	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑦 ∩ (𝑌 ∖ 𝑦)) = ∅)
55		fnun 6245	. . . . . . . . . . . . 13 ⊢ (((𝑧 Fn 𝑦 ∧ ((𝑌 ∖ 𝑦) × {𝑤}) Fn (𝑌 ∖ 𝑦)) ∧ (𝑦 ∩ (𝑌 ∖ 𝑦)) = ∅) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn (𝑦 ∪ (𝑌 ∖ 𝑦)))
56	49, 52, 54, 55	syl21anc 828	. . . . . . . . . . . 12 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn (𝑦 ∪ (𝑌 ∖ 𝑦)))
57		elpwi 4389	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝒫 𝑌 → 𝑦 ⊆ 𝑌)
58		undif 4273	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ⊆ 𝑌 ↔ (𝑦 ∪ (𝑌 ∖ 𝑦)) = 𝑌)
59	57, 58	sylib 210	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ 𝒫 𝑌 → (𝑦 ∪ (𝑌 ∖ 𝑦)) = 𝑌)
60	59	ad2antrl 718	. . . . . . . . . . . . . 14 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) → (𝑦 ∪ (𝑌 ∖ 𝑦)) = 𝑌)
61	60	adantr 474	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑦 ∪ (𝑌 ∖ 𝑦)) = 𝑌)
62	61	fneq2d 6229	. . . . . . . . . . . 12 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ((𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn (𝑦 ∪ (𝑌 ∖ 𝑦)) ↔ (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn 𝑌))
63	56, 62	mpbid 224	. . . . . . . . . . 11 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn 𝑌)
64		rnun 5797	. . . . . . . . . . . 12 ⊢ ran (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) = (ran 𝑧 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤}))
65		forn 6371	. . . . . . . . . . . . . . . 16 ⊢ (𝑧:𝑦–onto→𝑋 → ran 𝑧 = 𝑋)
66	65	ad2antll 719	. . . . . . . . . . . . . . 15 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) → ran 𝑧 = 𝑋)
67	66	adantr 474	. . . . . . . . . . . . . 14 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ran 𝑧 = 𝑋)
68	67	uneq1d 3989	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (ran 𝑧 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤})) = (𝑋 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤})))
69		fconst6g 6346	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 ∈ 𝑋 → ((𝑌 ∖ 𝑦) × {𝑤}):(𝑌 ∖ 𝑦)⟶𝑋)
70	69	frnd 6300	. . . . . . . . . . . . . . 15 ⊢ (𝑤 ∈ 𝑋 → ran ((𝑌 ∖ 𝑦) × {𝑤}) ⊆ 𝑋)
71	70	adantl 475	. . . . . . . . . . . . . 14 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ran ((𝑌 ∖ 𝑦) × {𝑤}) ⊆ 𝑋)
72		ssequn2 4009	. . . . . . . . . . . . . 14 ⊢ (ran ((𝑌 ∖ 𝑦) × {𝑤}) ⊆ 𝑋 ↔ (𝑋 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤})) = 𝑋)
73	71, 72	sylib 210	. . . . . . . . . . . . 13 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑋 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤})) = 𝑋)
74	68, 73	eqtrd 2814	. . . . . . . . . . . 12 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (ran 𝑧 ∪ ran ((𝑌 ∖ 𝑦) × {𝑤})) = 𝑋)
75	64, 74	syl5eq 2826	. . . . . . . . . . 11 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ran (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) = 𝑋)
76		df-fo 6143	. . . . . . . . . . 11 ⊢ ((𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})):𝑌–onto→𝑋 ↔ ((𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) Fn 𝑌 ∧ ran (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) = 𝑋))
77	63, 75, 76	sylanbrc 578	. . . . . . . . . 10 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})):𝑌–onto→𝑋)
78		foeq1 6364	. . . . . . . . . 10 ⊢ (𝑥 = (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})) → (𝑥:𝑌–onto→𝑋 ↔ (𝑧 ∪ ((𝑌 ∖ 𝑦) × {𝑤})):𝑌–onto→𝑋))
79	46, 77, 78	elabd 3560	. . . . . . . . 9 ⊢ ((((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) ∧ 𝑤 ∈ 𝑋) → ∃𝑥 𝑥:𝑌–onto→𝑋)
80	37, 79	exlimddv 1978	. . . . . . . 8 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ (𝑦 ∈ 𝒫 𝑌 ∧ 𝑧:𝑦–onto→𝑋)) → ∃𝑥 𝑥:𝑌–onto→𝑋)
81	80	expr 450	. . . . . . 7 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ 𝑦 ∈ 𝒫 𝑌) → (𝑧:𝑦–onto→𝑋 → ∃𝑥 𝑥:𝑌–onto→𝑋))
82	81	exlimdv 1976	. . . . . 6 ⊢ (((𝑌 ∈ V ∧ 𝑋 ≠ ∅) ∧ 𝑦 ∈ 𝒫 𝑌) → (∃𝑧 𝑧:𝑦–onto→𝑋 → ∃𝑥 𝑥:𝑌–onto→𝑋))
83	82	rexlimdva 3213	. . . . 5 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋 → ∃𝑥 𝑥:𝑌–onto→𝑋))
84	34, 83	impbid 204	. . . 4 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (∃𝑥 𝑥:𝑌–onto→𝑋 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
85	24, 84	bitrd 271	. . 3 ⊢ ((𝑌 ∈ V ∧ 𝑋 ≠ ∅) → (𝑋 ≼* 𝑌 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
86	22, 85	pm2.61dane 3057	. 2 ⊢ (𝑌 ∈ V → (𝑋 ≼* 𝑌 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))
87	1, 86	syl 17	1 ⊢ (𝑌 ∈ 𝑉 → (𝑋 ≼* 𝑌 ↔ ∃𝑦 ∈ 𝒫 𝑌∃𝑧 𝑧:𝑦–onto→𝑋))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1601  ∃wex 1823   ∈ wcel 2107   ≠ wne 2969  ∃wrex 3091  Vcvv 3398   ∖ cdif 3789   ∪ cun 3790   ∩ cin 3791   ⊆ wss 3792  ∅c0 4141  𝒫 cpw 4379  {csn 4398   class class class wbr 4888   × cxp 5355  ran crn 5358   Fn wfn 6132  –onto→wfo 6135  –1-1-onto→wf1o 6136   ≼^* cwdom 8753

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5019  ax-nul 5027  ax-pow 5079  ax-pr 5140  ax-un 7228

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4674  df-br 4889  df-opab 4951  df-mpt 4968  df-id 5263  df-xp 5363  df-rel 5364  df-cnv 5365  df-co 5366  df-dm 5367  df-rn 5368  df-fun 6139  df-fn 6140  df-f 6141  df-f1 6142  df-fo 6143  df-f1o 6144  df-wdom 8755

This theorem is referenced by:  brwdom3  8778