Theorem regr1lem 22590

Description: Lemma for regr1 22601. (Contributed by Mario Carneiro, 25-Aug-2015.)

Hypotheses

Ref	Expression
kqval.2	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
regr1lem.2	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
regr1lem.3	⊢ (𝜑 → 𝐽 ∈ Reg)
regr1lem.4	⊢ (𝜑 → 𝐴 ∈ 𝑋)
regr1lem.5	⊢ (𝜑 → 𝐵 ∈ 𝑋)
regr1lem.6	⊢ (𝜑 → 𝑈 ∈ 𝐽)
regr1lem.7	⊢ (𝜑 → ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))

Assertion

Ref	Expression
regr1lem	⊢ (𝜑 → (𝐴 ∈ 𝑈 → 𝐵 ∈ 𝑈))

Distinct variable groups:   𝑚,𝑛,𝑥,𝑦,𝐴   𝐵,𝑚,𝑛,𝑥,𝑦   𝑚,𝐽,𝑛,𝑥,𝑦   𝑚,𝐹,𝑛   𝑚,𝑋,𝑛,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑚,𝑛)   𝑈(𝑥,𝑦,𝑚,𝑛)   𝐹(𝑥,𝑦)

Proof of Theorem regr1lem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		regr1lem.3	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Reg)
2	1	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑈) → 𝐽 ∈ Reg)
3		regr1lem.6	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝐽)
4	3	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑈) → 𝑈 ∈ 𝐽)
5		simpr 488	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑈) → 𝐴 ∈ 𝑈)
6		regsep 22185	. . . 4 ⊢ ((𝐽 ∈ Reg ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) → ∃𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))
7	2, 4, 5, 6	syl3anc 1373	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑈) → ∃𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))
8		regr1lem.7	. . . . 5 ⊢ (𝜑 → ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
9	8	ad2antrr 726	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → ¬ ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
10		regr1lem.2	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
11	10	ad3antrrr 730	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐽 ∈ (TopOn‘𝑋))
12		simplrl 777	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝑧 ∈ 𝐽)
13		kqval.2	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ {𝑦 ∈ 𝐽 ∣ 𝑥 ∈ 𝑦})
14	13	kqopn 22585	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝐽) → (𝐹 “ 𝑧) ∈ (KQ‘𝐽))
15	11, 12, 14	syl2anc 587	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐹 “ 𝑧) ∈ (KQ‘𝐽))
16		toponuni 21765	. . . . . . . . . 10 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
17	11, 16	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝑋 = ∪ 𝐽)
18	17	difeq1d 4022	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝑋 ∖ ((cls‘𝐽)‘𝑧)) = (∪ 𝐽 ∖ ((cls‘𝐽)‘𝑧)))
19		topontop 21764	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
20	11, 19	syl 17	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐽 ∈ Top)
21		elssuni 4837	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝐽 → 𝑧 ⊆ ∪ 𝐽)
22	12, 21	syl 17	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝑧 ⊆ ∪ 𝐽)
23		eqid 2736	. . . . . . . . . . 11 ⊢ ∪ 𝐽 = ∪ 𝐽
24	23	clscld 21898	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑧 ⊆ ∪ 𝐽) → ((cls‘𝐽)‘𝑧) ∈ (Clsd‘𝐽))
25	20, 22, 24	syl2anc 587	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ((cls‘𝐽)‘𝑧) ∈ (Clsd‘𝐽))
26	23	cldopn 21882	. . . . . . . . 9 ⊢ (((cls‘𝐽)‘𝑧) ∈ (Clsd‘𝐽) → (∪ 𝐽 ∖ ((cls‘𝐽)‘𝑧)) ∈ 𝐽)
27	25, 26	syl 17	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (∪ 𝐽 ∖ ((cls‘𝐽)‘𝑧)) ∈ 𝐽)
28	18, 27	eqeltrd 2831	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ∈ 𝐽)
29	13	kqopn 22585	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ∈ 𝐽) → (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ∈ (KQ‘𝐽))
30	11, 28, 29	syl2anc 587	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ∈ (KQ‘𝐽))
31		simprrl 781	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → 𝐴 ∈ 𝑧)
32	31	adantr 484	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐴 ∈ 𝑧)
33		regr1lem.4	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
34	33	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐴 ∈ 𝑋)
35	13	kqfvima 22581	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ 𝑧 ↔ (𝐹‘𝐴) ∈ (𝐹 “ 𝑧)))
36	11, 12, 34, 35	syl3anc 1373	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐴 ∈ 𝑧 ↔ (𝐹‘𝐴) ∈ (𝐹 “ 𝑧)))
37	32, 36	mpbid 235	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐹‘𝐴) ∈ (𝐹 “ 𝑧))
38		regr1lem.5	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ 𝑋)
39	38	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐵 ∈ 𝑋)
40		simprrr 782	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → ((cls‘𝐽)‘𝑧) ⊆ 𝑈)
41	40	sseld 3886	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → (𝐵 ∈ ((cls‘𝐽)‘𝑧) → 𝐵 ∈ 𝑈))
42	41	con3dimp 412	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ¬ 𝐵 ∈ ((cls‘𝐽)‘𝑧))
43	39, 42	eldifd 3864	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝐵 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))
44	13	kqfvima 22581	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ∈ 𝐽 ∧ 𝐵 ∈ 𝑋) → (𝐵 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ↔ (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))))
45	11, 28, 39, 44	syl3anc 1373	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐵 ∈ (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ↔ (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))))
46	43, 45	mpbid 235	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))))
47	23	sscls 21907	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑧 ⊆ ∪ 𝐽) → 𝑧 ⊆ ((cls‘𝐽)‘𝑧))
48	20, 22, 47	syl2anc 587	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → 𝑧 ⊆ ((cls‘𝐽)‘𝑧))
49	48	sscond 4042	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → (𝑋 ∖ ((cls‘𝐽)‘𝑧)) ⊆ (𝑋 ∖ 𝑧))
50		imass2 5950	. . . . . . . 8 ⊢ ((𝑋 ∖ ((cls‘𝐽)‘𝑧)) ⊆ (𝑋 ∖ 𝑧) → (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ⊆ (𝐹 “ (𝑋 ∖ 𝑧)))
51		sslin 4135	. . . . . . . 8 ⊢ ((𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ⊆ (𝐹 “ (𝑋 ∖ 𝑧)) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) ⊆ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))))
52	49, 50, 51	3syl 18	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) ⊆ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))))
53	13	kqdisj 22583	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑧 ∈ 𝐽) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))) = ∅)
54	11, 12, 53	syl2anc 587	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))) = ∅)
55		sseq0 4300	. . . . . . 7 ⊢ ((((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) ⊆ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))) ∧ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ 𝑧))) = ∅) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) = ∅)
56	52, 54, 55	syl2anc 587	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) = ∅)
57		eleq2 2819	. . . . . . . 8 ⊢ (𝑚 = (𝐹 “ 𝑧) → ((𝐹‘𝐴) ∈ 𝑚 ↔ (𝐹‘𝐴) ∈ (𝐹 “ 𝑧)))
58		ineq1 4106	. . . . . . . . 9 ⊢ (𝑚 = (𝐹 “ 𝑧) → (𝑚 ∩ 𝑛) = ((𝐹 “ 𝑧) ∩ 𝑛))
59	58	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑚 = (𝐹 “ 𝑧) → ((𝑚 ∩ 𝑛) = ∅ ↔ ((𝐹 “ 𝑧) ∩ 𝑛) = ∅))
60	57, 59	3anbi13d 1440	. . . . . . 7 ⊢ (𝑚 = (𝐹 “ 𝑧) → (((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ((𝐹‘𝐴) ∈ (𝐹 “ 𝑧) ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ ((𝐹 “ 𝑧) ∩ 𝑛) = ∅)))
61		eleq2 2819	. . . . . . . 8 ⊢ (𝑛 = (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) → ((𝐹‘𝐵) ∈ 𝑛 ↔ (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))))
62		ineq2 4107	. . . . . . . . 9 ⊢ (𝑛 = (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) → ((𝐹 “ 𝑧) ∩ 𝑛) = ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))))
63	62	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑛 = (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) → (((𝐹 “ 𝑧) ∩ 𝑛) = ∅ ↔ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) = ∅))
64	61, 63	3anbi23d 1441	. . . . . . 7 ⊢ (𝑛 = (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) → (((𝐹‘𝐴) ∈ (𝐹 “ 𝑧) ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ ((𝐹 “ 𝑧) ∩ 𝑛) = ∅) ↔ ((𝐹‘𝐴) ∈ (𝐹 “ 𝑧) ∧ (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ∧ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) = ∅)))
65	60, 64	rspc2ev 3539	. . . . . 6 ⊢ (((𝐹 “ 𝑧) ∈ (KQ‘𝐽) ∧ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ∈ (KQ‘𝐽) ∧ ((𝐹‘𝐴) ∈ (𝐹 “ 𝑧) ∧ (𝐹‘𝐵) ∈ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧))) ∧ ((𝐹 “ 𝑧) ∩ (𝐹 “ (𝑋 ∖ ((cls‘𝐽)‘𝑧)))) = ∅)) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
66	15, 30, 37, 46, 56, 65	syl113anc 1384	. . . . 5 ⊢ ((((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) ∧ ¬ 𝐵 ∈ 𝑈) → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
67	66	ex 416	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → (¬ 𝐵 ∈ 𝑈 → ∃𝑚 ∈ (KQ‘𝐽)∃𝑛 ∈ (KQ‘𝐽)((𝐹‘𝐴) ∈ 𝑚 ∧ (𝐹‘𝐵) ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
68	9, 67	mt3d 150	. . 3 ⊢ (((𝜑 ∧ 𝐴 ∈ 𝑈) ∧ (𝑧 ∈ 𝐽 ∧ (𝐴 ∈ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑈))) → 𝐵 ∈ 𝑈)
69	7, 68	rexlimddv 3200	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑈) → 𝐵 ∈ 𝑈)
70	69	ex 416	1 ⊢ (𝜑 → (𝐴 ∈ 𝑈 → 𝐵 ∈ 𝑈))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2112  ∃wrex 3052  {crab 3055   ∖ cdif 3850   ∩ cin 3852   ⊆ wss 3853  ∅c0 4223  ∪ cuni 4805   ↦ cmpt 5120   “ cima 5539  ‘cfv 6358  Topctop 21744  TopOnctopon 21761  Clsdccld 21867  clsccl 21869  Regcreg 22160  KQckq 22544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-int 4846  df-iun 4892  df-iin 4893  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-qtop 16966  df-top 21745  df-topon 21762  df-cld 21870  df-cls 21872  df-reg 22167  df-kq 22545

This theorem is referenced by:  regr1lem2  22591