Theorem ismrc 42688

Description: A function is a Moore closure operator iff it satisfies mrcssid 17661, mrcss 17660, and mrcidm 17663. (Contributed by Stefan O'Rear, 1-Feb-2015.)

Assertion

Ref	Expression
ismrc	⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐵,𝑦

Proof of Theorem ismrc

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

Step	Hyp	Ref	Expression
1		fnmrc 17651	. . . . 5 ⊢ mrCls Fn ∪ ran Moore
2		fnfun 6668	. . . . 5 ⊢ (mrCls Fn ∪ ran Moore → Fun mrCls)
3	1, 2	ax-mp 5	. . . 4 ⊢ Fun mrCls
4		fvelima 6973	. . . 4 ⊢ ((Fun mrCls ∧ 𝐹 ∈ (mrCls “ (Moore‘𝐵))) → ∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹)
5	3, 4	mpan 690	. . 3 ⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) → ∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹)
6		elfvex 6944	. . . . . 6 ⊢ (𝑧 ∈ (Moore‘𝐵) → 𝐵 ∈ V)
7		eqid 2734	. . . . . . . 8 ⊢ (mrCls‘𝑧) = (mrCls‘𝑧)
8	7	mrcf 17653	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵⟶𝑧)
9		mresspw 17636	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → 𝑧 ⊆ 𝒫 𝐵)
10	8, 9	fssd 6753	. . . . . 6 ⊢ (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵)
11	7	mrcssid 17661	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
12	11	adantrr 717	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
13	7	mrcss 17660	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝐵) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
14	13	3expb 1119	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝐵)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
15	14	ancom2s 650	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
16	7	mrcidm 17663	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥 ⊆ 𝐵) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
17	16	adantrr 717	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
18	12, 15, 17	3jca 1127	. . . . . . . 8 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))
19	18	ex 412	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
20	19	alrimivv 1925	. . . . . 6 ⊢ (𝑧 ∈ (Moore‘𝐵) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
21	6, 10, 20	3jca 1127	. . . . 5 ⊢ (𝑧 ∈ (Moore‘𝐵) → (𝐵 ∈ V ∧ (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))))
22		feq1 6716	. . . . . 6 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ↔ 𝐹:𝒫 𝐵⟶𝒫 𝐵))
23		fveq1 6905	. . . . . . . . . 10 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘𝑥) = (𝐹‘𝑥))
24	23	sseq2d 4027	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ↔ 𝑥 ⊆ (𝐹‘𝑥)))
25		fveq1 6905	. . . . . . . . . 10 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘𝑦) = (𝐹‘𝑦))
26	25, 23	sseq12d 4028	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ↔ (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
27		id 22	. . . . . . . . . . 11 ⊢ ((mrCls‘𝑧) = 𝐹 → (mrCls‘𝑧) = 𝐹)
28	27, 23	fveq12d 6913	. . . . . . . . . 10 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = (𝐹‘(𝐹‘𝑥)))
29	28, 23	eqeq12d 2750	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥) ↔ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))
30	24, 26, 29	3anbi123d 1435	. . . . . . . 8 ⊢ ((mrCls‘𝑧) = 𝐹 → ((𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)) ↔ (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
31	30	imbi2d 340	. . . . . . 7 ⊢ ((mrCls‘𝑧) = 𝐹 → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
32	31	2albidv 1920	. . . . . 6 ⊢ ((mrCls‘𝑧) = 𝐹 → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
33	22, 32	3anbi23d 1438	. . . . 5 ⊢ ((mrCls‘𝑧) = 𝐹 → ((𝐵 ∈ V ∧ (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))))
34	21, 33	syl5ibcom 245	. . . 4 ⊢ (𝑧 ∈ (Moore‘𝐵) → ((mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))))
35	34	rexlimiv 3145	. . 3 ⊢ (∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
36	5, 35	syl 17	. 2 ⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
37		simp1 1135	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐵 ∈ V)
38		simp2 1136	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹:𝒫 𝐵⟶𝒫 𝐵)
39		ssid 4017	. . . . . . 7 ⊢ 𝑧 ⊆ 𝑧
40		3simpb 1148	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))
41	40	imim2i 16	. . . . . . . . . 10 ⊢ (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
42	41	2alimi 1808	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
43		sseq1 4020	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
44	43	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
45		sseq12 4022	. . . . . . . . . . . . . 14 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑧 ⊆ 𝑧))
46	45	ancoms 458	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑧 ⊆ 𝑧))
47	44, 46	anbi12d 632	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) ↔ (𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧)))
48		id 22	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
49		fveq2 6906	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
50	48, 49	sseq12d 4028	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ (𝐹‘𝑥) ↔ 𝑧 ⊆ (𝐹‘𝑧)))
51	50	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑥 ⊆ (𝐹‘𝑥) ↔ 𝑧 ⊆ (𝐹‘𝑧)))
52		2fveq3 6911	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → (𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑧)))
53	52, 49	eqeq12d 2750	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → ((𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
54	53	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
55	51, 54	anbi12d 632	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) ↔ (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
56	47, 55	imbi12d 344	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) ↔ ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))))
57	56	spc2gv 3599	. . . . . . . . . 10 ⊢ ((𝑧 ∈ V ∧ 𝑧 ∈ V) → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))))
58	57	el2v 3484	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
59	42, 58	syl 17	. . . . . . . 8 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
60	59	3ad2ant3 1134	. . . . . . 7 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
61	39, 60	mpan2i 697	. . . . . 6 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → (𝑧 ⊆ 𝐵 → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
62	61	imp 406	. . . . 5 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
63	62	simpld 494	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → 𝑧 ⊆ (𝐹‘𝑧))
64		simp2 1136	. . . . . . . . 9 ⊢ ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥))
65	64	imim2i 16	. . . . . . . 8 ⊢ (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
66	65	2alimi 1808	. . . . . . 7 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
67	66	3ad2ant3 1134	. . . . . 6 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
68	43	adantr 480	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
69		sseq12 4022	. . . . . . . . . . 11 ⊢ ((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑤 ⊆ 𝑧))
70	69	ancoms 458	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑦 ⊆ 𝑥 ↔ 𝑤 ⊆ 𝑧))
71	68, 70	anbi12d 632	. . . . . . . . 9 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) ↔ (𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧)))
72		fveq2 6906	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝐹‘𝑦) = (𝐹‘𝑤))
73		sseq12 4022	. . . . . . . . . 10 ⊢ (((𝐹‘𝑦) = (𝐹‘𝑤) ∧ (𝐹‘𝑥) = (𝐹‘𝑧)) → ((𝐹‘𝑦) ⊆ (𝐹‘𝑥) ↔ (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
74	72, 49, 73	syl2anr 597	. . . . . . . . 9 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝐹‘𝑦) ⊆ (𝐹‘𝑥) ↔ (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
75	71, 74	imbi12d 344	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) ↔ ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))))
76	75	spc2gv 3599	. . . . . . 7 ⊢ ((𝑧 ∈ V ∧ 𝑤 ∈ V) → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))))
77	76	el2v 3484	. . . . . 6 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
78	67, 77	syl 17	. . . . 5 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
79	78	3impib 1115	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))
80	62	simprd 495	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))
81	37, 38, 63, 79, 80	ismrcd2 42686	. . 3 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹 = (mrCls‘dom (𝐹 ∩ I )))
82	37, 38, 63, 79, 80	ismrcd1 42685	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → dom (𝐹 ∩ I ) ∈ (Moore‘𝐵))
83		fvssunirn 6939	. . . . . 6 ⊢ (Moore‘𝐵) ⊆ ∪ ran Moore
84	1	fndmi 6672	. . . . . 6 ⊢ dom mrCls = ∪ ran Moore
85	83, 84	sseqtrri 4032	. . . . 5 ⊢ (Moore‘𝐵) ⊆ dom mrCls
86		funfvima2 7250	. . . . 5 ⊢ ((Fun mrCls ∧ (Moore‘𝐵) ⊆ dom mrCls) → (dom (𝐹 ∩ I ) ∈ (Moore‘𝐵) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵))))
87	3, 85, 86	mp2an 692	. . . 4 ⊢ (dom (𝐹 ∩ I ) ∈ (Moore‘𝐵) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵)))
88	82, 87	syl 17	. . 3 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵)))
89	81, 88	eqeltrd 2838	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹 ∈ (mrCls “ (Moore‘𝐵)))
90	36, 89	impbii 209	1 ⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1534   = wceq 1536   ∈ wcel 2105  ∃wrex 3067  Vcvv 3477   ∩ cin 3961   ⊆ wss 3962  𝒫 cpw 4604  ∪ cuni 4911   I cid 5581  dom cdm 5688  ran crn 5689   “ cima 5691  Fun wfun 6556   Fn wfn 6557  ⟶wf 6558  ‘cfv 6562  Moorecmre 17626  mrClscmrc 17627

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-fv 6570  df-mre 17630  df-mrc 17631

This theorem is referenced by: (None)