Theorem mreexexlem2d 17690

Description: Used in mreexexlem4d 17692 to prove the induction step in mreexexd 17693. See the proof of Proposition 4.2.1 in [FaureFrolicher] p. 86 to 87. (Contributed by David Moews, 1-May-2017.)

Hypotheses

Ref	Expression
mreexexlem2d.1	⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋))
mreexexlem2d.2	⊢ 𝑁 = (mrCls‘𝐴)
mreexexlem2d.3	⊢ 𝐼 = (mrInd‘𝐴)
mreexexlem2d.4	⊢ (𝜑 → ∀𝑠 ∈ 𝒫 𝑋∀𝑦 ∈ 𝑋 ∀𝑧 ∈ ((𝑁‘(𝑠 ∪ {𝑦})) ∖ (𝑁‘𝑠))𝑦 ∈ (𝑁‘(𝑠 ∪ {𝑧})))
mreexexlem2d.5	⊢ (𝜑 → 𝐹 ⊆ (𝑋 ∖ 𝐻))
mreexexlem2d.6	⊢ (𝜑 → 𝐺 ⊆ (𝑋 ∖ 𝐻))
mreexexlem2d.7	⊢ (𝜑 → 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)))
mreexexlem2d.8	⊢ (𝜑 → (𝐹 ∪ 𝐻) ∈ 𝐼)
mreexexlem2d.9	⊢ (𝜑 → 𝑌 ∈ 𝐹)

Assertion

Ref	Expression
mreexexlem2d	⊢ (𝜑 → ∃𝑔 ∈ 𝐺 (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼))

Distinct variable groups:   𝐹,𝑠,𝑔,𝑦,𝑧   𝐺,𝑠,𝑔,𝑦,𝑧   𝐻,𝑠,𝑔,𝑦,𝑧   𝜑,𝑠,𝑔,𝑦,𝑧   𝑌,𝑠,𝑔,𝑦,𝑧   𝑁,𝑠,𝑔,𝑦,𝑧   𝑋,𝑠,𝑦

Allowed substitution hints:   𝐴(𝑦,𝑧,𝑔,𝑠)   𝐼(𝑦,𝑧,𝑔,𝑠)   𝑋(𝑧,𝑔)

Proof of Theorem mreexexlem2d

Step	Hyp	Ref	Expression
1		mreexexlem2d.7	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)))
2	1	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)))
3		mreexexlem2d.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ (Moore‘𝑋))
4	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝐴 ∈ (Moore‘𝑋))
5		mreexexlem2d.2	. . . . . . . . 9 ⊢ 𝑁 = (mrCls‘𝐴)
6		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
7		ssun2 4189	. . . . . . . . . . . . 13 ⊢ 𝐻 ⊆ ((𝐹 ∖ {𝑌}) ∪ 𝐻)
8		difundir 4297	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ∪ 𝐻) ∖ {𝑌}) = ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∖ {𝑌}))
9		mreexexlem2d.9	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑌 ∈ 𝐹)
10		incom 4217	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹 ∩ 𝐻) = (𝐻 ∩ 𝐹)
11		mreexexlem2d.5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹 ⊆ (𝑋 ∖ 𝐻))
12		ssdifin0 4492	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐹 ⊆ (𝑋 ∖ 𝐻) → (𝐹 ∩ 𝐻) = ∅)
13	11, 12	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐹 ∩ 𝐻) = ∅)
14	10, 13	eqtr3id 2789	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐻 ∩ 𝐹) = ∅)
15		minel 4472	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑌 ∈ 𝐹 ∧ (𝐻 ∩ 𝐹) = ∅) → ¬ 𝑌 ∈ 𝐻)
16	9, 14, 15	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ¬ 𝑌 ∈ 𝐻)
17		difsnb 4811	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑌 ∈ 𝐻 ↔ (𝐻 ∖ {𝑌}) = 𝐻)
18	16, 17	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐻 ∖ {𝑌}) = 𝐻)
19	18	uneq2d 4178	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∖ {𝑌})) = ((𝐹 ∖ {𝑌}) ∪ 𝐻))
20	8, 19	eqtrid 2787	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐹 ∪ 𝐻) ∖ {𝑌}) = ((𝐹 ∖ {𝑌}) ∪ 𝐻))
21	7, 20	sseqtrrid 4049	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ⊆ ((𝐹 ∪ 𝐻) ∖ {𝑌}))
22		mreexexlem2d.3	. . . . . . . . . . . . . . 15 ⊢ 𝐼 = (mrInd‘𝐴)
23		mreexexlem2d.8	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐹 ∪ 𝐻) ∈ 𝐼)
24	22, 3, 23	mrissd 17681	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹 ∪ 𝐻) ⊆ 𝑋)
25	24	ssdifssd 4157	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐹 ∪ 𝐻) ∖ {𝑌}) ⊆ 𝑋)
26	3, 5, 25	mrcssidd 17670	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐹 ∪ 𝐻) ∖ {𝑌}) ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
27	21, 26	sstrd 4006	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
28	27	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝐻 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
29	6, 28	unssd 4202	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝐺 ∪ 𝐻) ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
30	4, 5	mrcssvd 17668	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})) ⊆ 𝑋)
31	4, 5, 29, 30	mrcssd 17669	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝑁‘(𝐺 ∪ 𝐻)) ⊆ (𝑁‘(𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))))
32	25	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → ((𝐹 ∪ 𝐻) ∖ {𝑌}) ⊆ 𝑋)
33	4, 5, 32	mrcidmd 17671	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝑁‘(𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) = (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
34	31, 33	sseqtrd 4036	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝑁‘(𝐺 ∪ 𝐻)) ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
35	2, 34	sstrd 4006	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝐹 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
36	9	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝑌 ∈ 𝐹)
37	35, 36	sseldd 3996	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝑌 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
38	23	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝐹 ∪ 𝐻) ∈ 𝐼)
39		ssun1 4188	. . . . . . 7 ⊢ 𝐹 ⊆ (𝐹 ∪ 𝐻)
40	39, 36	sselid 3993	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → 𝑌 ∈ (𝐹 ∪ 𝐻))
41	5, 22, 4, 38, 40	ismri2dad 17682	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → ¬ 𝑌 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
42	37, 41	pm2.65da 817	. . . 4 ⊢ (𝜑 → ¬ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
43		nss 4060	. . . 4 ⊢ (¬ 𝐺 ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})) ↔ ∃𝑔(𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))))
44	42, 43	sylib 218	. . 3 ⊢ (𝜑 → ∃𝑔(𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))))
45		simprl 771	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → 𝑔 ∈ 𝐺)
46		ssun1 4188	. . . . . . . . . 10 ⊢ (𝐹 ∖ {𝑌}) ⊆ ((𝐹 ∖ {𝑌}) ∪ 𝐻)
47	46, 20	sseqtrrid 4049	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 ∖ {𝑌}) ⊆ ((𝐹 ∪ 𝐻) ∖ {𝑌}))
48	47, 26	sstrd 4006	. . . . . . . 8 ⊢ (𝜑 → (𝐹 ∖ {𝑌}) ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
49	48	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → (𝐹 ∖ {𝑌}) ⊆ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
50		simprr 773	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))
51	49, 50	ssneldd 3998	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ¬ 𝑔 ∈ (𝐹 ∖ {𝑌}))
52		unass 4182	. . . . . . 7 ⊢ (((𝐹 ∖ {𝑌}) ∪ 𝐻) ∪ {𝑔}) = ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔}))
53	3	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → 𝐴 ∈ (Moore‘𝑋))
54		mreexexlem2d.4	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑠 ∈ 𝒫 𝑋∀𝑦 ∈ 𝑋 ∀𝑧 ∈ ((𝑁‘(𝑠 ∪ {𝑦})) ∖ (𝑁‘𝑠))𝑦 ∈ (𝑁‘(𝑠 ∪ {𝑧})))
55	54	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ∀𝑠 ∈ 𝒫 𝑋∀𝑦 ∈ 𝑋 ∀𝑧 ∈ ((𝑁‘(𝑠 ∪ {𝑦})) ∖ (𝑁‘𝑠))𝑦 ∈ (𝑁‘(𝑠 ∪ {𝑧})))
56	23	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → (𝐹 ∪ 𝐻) ∈ 𝐼)
57		difss 4146	. . . . . . . . . 10 ⊢ (𝐹 ∖ {𝑌}) ⊆ 𝐹
58		unss1 4195	. . . . . . . . . 10 ⊢ ((𝐹 ∖ {𝑌}) ⊆ 𝐹 → ((𝐹 ∖ {𝑌}) ∪ 𝐻) ⊆ (𝐹 ∪ 𝐻))
59	57, 58	mp1i 13	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ((𝐹 ∖ {𝑌}) ∪ 𝐻) ⊆ (𝐹 ∪ 𝐻))
60	53, 5, 22, 56, 59	mrissmrid 17686	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ((𝐹 ∖ {𝑌}) ∪ 𝐻) ∈ 𝐼)
61		mreexexlem2d.6	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ⊆ (𝑋 ∖ 𝐻))
62	61	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → 𝐺 ⊆ (𝑋 ∖ 𝐻))
63	62	difss2d 4149	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → 𝐺 ⊆ 𝑋)
64	63, 45	sseldd 3996	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → 𝑔 ∈ 𝑋)
65	20	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ((𝐹 ∪ 𝐻) ∖ {𝑌}) = ((𝐹 ∖ {𝑌}) ∪ 𝐻))
66	65	fveq2d 6911	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})) = (𝑁‘((𝐹 ∖ {𝑌}) ∪ 𝐻)))
67	50, 66	neleqtrd 2861	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ¬ 𝑔 ∈ (𝑁‘((𝐹 ∖ {𝑌}) ∪ 𝐻)))
68	53, 5, 22, 55, 60, 64, 67	mreexmrid 17688	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → (((𝐹 ∖ {𝑌}) ∪ 𝐻) ∪ {𝑔}) ∈ 𝐼)
69	52, 68	eqeltrrid 2844	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼)
70	45, 51, 69	jca32 515	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌})))) → (𝑔 ∈ 𝐺 ∧ (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼)))
71	70	ex 412	. . . 4 ⊢ (𝜑 → ((𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → (𝑔 ∈ 𝐺 ∧ (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼))))
72	71	eximdv 1915	. . 3 ⊢ (𝜑 → (∃𝑔(𝑔 ∈ 𝐺 ∧ ¬ 𝑔 ∈ (𝑁‘((𝐹 ∪ 𝐻) ∖ {𝑌}))) → ∃𝑔(𝑔 ∈ 𝐺 ∧ (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼))))
73	44, 72	mpd 15	. 2 ⊢ (𝜑 → ∃𝑔(𝑔 ∈ 𝐺 ∧ (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼)))
74		df-rex 3069	. 2 ⊢ (∃𝑔 ∈ 𝐺 (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼) ↔ ∃𝑔(𝑔 ∈ 𝐺 ∧ (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼)))
75	73, 74	sylibr 234	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝐺 (¬ 𝑔 ∈ (𝐹 ∖ {𝑌}) ∧ ((𝐹 ∖ {𝑌}) ∪ (𝐻 ∪ {𝑔})) ∈ 𝐼))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537  ∃wex 1776   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068   ∖ cdif 3960   ∪ cun 3961   ∩ cin 3962   ⊆ wss 3963  ∅c0 4339  𝒫 cpw 4605  {csn 4631  ‘cfv 6563  Moorecmre 17627  mrClscmrc 17628  mrIndcmri 17629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-mre 17631  df-mrc 17632  df-mri 17633

This theorem is referenced by:  mreexexlem4d  17692