Theorem ismrc 42712

Description: A function is a Moore closure operator iff it satisfies mrcssid 17660, mrcss 17659, and mrcidm 17662. (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 17650	. . . . 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 6974	. . . 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 2737	. . . . . . . 8 ⊢ (mrCls‘𝑧) = (mrCls‘𝑧)
8	7	mrcf 17652	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵⟶𝑧)
9		mresspw 17635	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → 𝑧 ⊆ 𝒫 𝐵)
10	8, 9	fssd 6753	. . . . . 6 ⊢ (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵)
11	7	mrcssid 17660	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥 ⊆ 𝐵) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
12	11	adantrr 717	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
13	7	mrcss 17659	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝐵) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
14	13	3expb 1121	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑦 ⊆ 𝑥 ∧ 𝑥 ⊆ 𝐵)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
15	14	ancom2s 650	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
16	7	mrcidm 17662	. . . . . . . . . 10 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥 ⊆ 𝐵) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
17	16	adantrr 717	. . . . . . . . 9 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
18	12, 15, 17	3jca 1129	. . . . . . . 8 ⊢ ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥)) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))
19	18	ex 412	. . . . . . 7 ⊢ (𝑧 ∈ (Moore‘𝐵) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
20	19	alrimivv 1928	. . . . . 6 ⊢ (𝑧 ∈ (Moore‘𝐵) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
21	6, 10, 20	3jca 1129	. . . . 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 4016	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ↔ 𝑥 ⊆ (𝐹‘𝑥)))
25		fveq1 6905	. . . . . . . . . 10 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘𝑦) = (𝐹‘𝑦))
26	25, 23	sseq12d 4017	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ↔ (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
27		id 22	. . . . . . . . . . 11 ⊢ ((mrCls‘𝑧) = 𝐹 → (mrCls‘𝑧) = 𝐹)
28	27, 23	fveq12d 6913	. . . . . . . . . 10 ⊢ ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = (𝐹‘(𝐹‘𝑥)))
29	28, 23	eqeq12d 2753	. . . . . . . . 9 ⊢ ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥) ↔ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))
30	24, 26, 29	3anbi123d 1438	. . . . . . . 8 ⊢ ((mrCls‘𝑧) = 𝐹 → ((𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)) ↔ (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
31	30	imbi2d 340	. . . . . . 7 ⊢ ((mrCls‘𝑧) = 𝐹 → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
32	31	2albidv 1923	. . . . . 6 ⊢ ((mrCls‘𝑧) = 𝐹 → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
33	22, 32	3anbi23d 1441	. . . . 5 ⊢ ((mrCls‘𝑧) = 𝐹 → ((𝐵 ∈ V ∧ (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))))
34	21, 33	syl5ibcom 245	. . . 4 ⊢ (𝑧 ∈ (Moore‘𝐵) → ((mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))))
35	34	rexlimiv 3148	. . 3 ⊢ (∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
36	5, 35	syl 17	. 2 ⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))
37		simp1 1137	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐵 ∈ V)
38		simp2 1138	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹:𝒫 𝐵⟶𝒫 𝐵)
39		ssid 4006	. . . . . . 7 ⊢ 𝑧 ⊆ 𝑧
40		3simpb 1150	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))
41	40	imim2i 16	. . . . . . . . . 10 ⊢ (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
42	41	2alimi 1812	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))))
43		sseq1 4009	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
44	43	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
45		sseq12 4011	. . . . . . . . . . . . . 14 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑧 ⊆ 𝑧))
46	45	ancoms 458	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑧 ⊆ 𝑧))
47	44, 46	anbi12d 632	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) ↔ (𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧)))
48		id 22	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
49		fveq2 6906	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
50	48, 49	sseq12d 4017	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ (𝐹‘𝑥) ↔ 𝑧 ⊆ (𝐹‘𝑧)))
51	50	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (𝑥 ⊆ (𝐹‘𝑥) ↔ 𝑧 ⊆ (𝐹‘𝑧)))
52		2fveq3 6911	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → (𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑧)))
53	52, 49	eqeq12d 2753	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑧 → ((𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
54	53	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
55	51, 54	anbi12d 632	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) ↔ (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
56	47, 55	imbi12d 344	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑧) → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) ↔ ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))))
57	56	spc2gv 3600	. . . . . . . . . 10 ⊢ ((𝑧 ∈ V ∧ 𝑧 ∈ V) → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))))
58	57	el2v 3487	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
59	42, 58	syl 17	. . . . . . . 8 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
60	59	3ad2ant3 1136	. . . . . . 7 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ((𝑧 ⊆ 𝐵 ∧ 𝑧 ⊆ 𝑧) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
61	39, 60	mpan2i 697	. . . . . 6 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → (𝑧 ⊆ 𝐵 → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))))
62	61	imp 406	. . . . 5 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → (𝑧 ⊆ (𝐹‘𝑧) ∧ (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧)))
63	62	simpld 494	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → 𝑧 ⊆ (𝐹‘𝑧))
64		simp2 1138	. . . . . . . . 9 ⊢ ((𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥))
65	64	imim2i 16	. . . . . . . 8 ⊢ (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
66	65	2alimi 1812	. . . . . . 7 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
67	66	3ad2ant3 1136	. . . . . 6 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)))
68	43	adantr 480	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑥 ⊆ 𝐵 ↔ 𝑧 ⊆ 𝐵))
69		sseq12 4011	. . . . . . . . . . 11 ⊢ ((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) → (𝑦 ⊆ 𝑥 ↔ 𝑤 ⊆ 𝑧))
70	69	ancoms 458	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑦 ⊆ 𝑥 ↔ 𝑤 ⊆ 𝑧))
71	68, 70	anbi12d 632	. . . . . . . . 9 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) ↔ (𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧)))
72		fveq2 6906	. . . . . . . . . 10 ⊢ (𝑦 = 𝑤 → (𝐹‘𝑦) = (𝐹‘𝑤))
73		sseq12 4011	. . . . . . . . . 10 ⊢ (((𝐹‘𝑦) = (𝐹‘𝑤) ∧ (𝐹‘𝑥) = (𝐹‘𝑧)) → ((𝐹‘𝑦) ⊆ (𝐹‘𝑥) ↔ (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
74	72, 49, 73	syl2anr 597	. . . . . . . . 9 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝐹‘𝑦) ⊆ (𝐹‘𝑥) ↔ (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
75	71, 74	imbi12d 344	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) ↔ ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))))
76	75	spc2gv 3600	. . . . . . 7 ⊢ ((𝑧 ∈ V ∧ 𝑤 ∈ V) → (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))))
77	76	el2v 3487	. . . . . 6 ⊢ (∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝐹‘𝑦) ⊆ (𝐹‘𝑥)) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
78	67, 77	syl 17	. . . . 5 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → ((𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧)))
79	78	3impib 1117	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵 ∧ 𝑤 ⊆ 𝑧) → (𝐹‘𝑤) ⊆ (𝐹‘𝑧))
80	62	simprd 495	. . . 4 ⊢ (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) ∧ 𝑧 ⊆ 𝐵) → (𝐹‘(𝐹‘𝑧)) = (𝐹‘𝑧))
81	37, 38, 63, 79, 80	ismrcd2 42710	. . 3 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹 = (mrCls‘dom (𝐹 ∩ I )))
82	37, 38, 63, 79, 80	ismrcd1 42709	. . . 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 4033	. . . . 5 ⊢ (Moore‘𝐵) ⊆ dom mrCls
86		funfvima2 7251	. . . . 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 2841	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))) → 𝐹 ∈ (mrCls “ (Moore‘𝐵)))
90	36, 89	impbii 209	1 ⊢ (𝐹 ∈ (mrCls “ (Moore‘𝐵)) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝑥) → (𝑥 ⊆ (𝐹‘𝑥) ∧ (𝐹‘𝑦) ⊆ (𝐹‘𝑥) ∧ (𝐹‘(𝐹‘𝑥)) = (𝐹‘𝑥)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1538   = wceq 1540   ∈ wcel 2108  ∃wrex 3070  Vcvv 3480   ∩ cin 3950   ⊆ wss 3951  𝒫 cpw 4600  ∪ cuni 4907   I cid 5577  dom cdm 5685  ran crn 5686   “ cima 5688  Fun wfun 6555   Fn wfn 6556  ⟶wf 6557  ‘cfv 6561  Moorecmre 17625  mrClscmrc 17626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-mre 17629  df-mrc 17630

This theorem is referenced by: (None)