Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ismrc Structured version   Visualization version   GIF version

Theorem ismrc 43492
Description: A function is a Moore closure operator iff it satisfies mrcssid 17697, mrcss 17696, and mrcidm 17699. (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.
StepHypRef Expression
1 fnmrc 17687 . . . . 5 mrCls Fn ran Moore
2 fnfun 6639 . . . . 5 (mrCls Fn ran Moore → Fun mrCls)
31, 2ax-mp 5 . . . 4 Fun mrCls
4 fvelima 6950 . . . 4 ((Fun mrCls ∧ 𝐹 ∈ (mrCls “ (Moore‘𝐵))) → ∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹)
53, 4mpan 703 . . 3 (𝐹 ∈ (mrCls “ (Moore‘𝐵)) → ∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹)
6 elfvex 6920 . . . . . 6 (𝑧 ∈ (Moore‘𝐵) → 𝐵 ∈ V)
7 eqid 2765 . . . . . . . 8 (mrCls‘𝑧) = (mrCls‘𝑧)
87mrcf 17689 . . . . . . 7 (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵𝑧)
9 mresspw 17668 . . . . . . 7 (𝑧 ∈ (Moore‘𝐵) → 𝑧 ⊆ 𝒫 𝐵)
108, 9fssd 6727 . . . . . 6 (𝑧 ∈ (Moore‘𝐵) → (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵)
117mrcssid 17697 . . . . . . . . . 10 ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥𝐵) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
1211adantrr 730 . . . . . . . . 9 ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥𝐵𝑦𝑥)) → 𝑥 ⊆ ((mrCls‘𝑧)‘𝑥))
137mrcss 17696 . . . . . . . . . . 11 ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑦𝑥𝑥𝐵) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
14133expb 1138 . . . . . . . . . 10 ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑦𝑥𝑥𝐵)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
1514ancom2s 663 . . . . . . . . 9 ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥𝐵𝑦𝑥)) → ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥))
167mrcidm 17699 . . . . . . . . . 10 ((𝑧 ∈ (Moore‘𝐵) ∧ 𝑥𝐵) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
1716adantrr 730 . . . . . . . . 9 ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥𝐵𝑦𝑥)) → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))
1812, 15, 173jca 1146 . . . . . . . 8 ((𝑧 ∈ (Moore‘𝐵) ∧ (𝑥𝐵𝑦𝑥)) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))
1918ex 418 . . . . . . 7 (𝑧 ∈ (Moore‘𝐵) → ((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
2019alrimivv 1961 . . . . . 6 (𝑧 ∈ (Moore‘𝐵) → ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))))
216, 10, 203jca 1146 . . . . 5 (𝑧 ∈ (Moore‘𝐵) → (𝐵 ∈ V ∧ (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))))
22 feq1 6687 . . . . . 6 ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵𝐹:𝒫 𝐵⟶𝒫 𝐵))
23 fveq1 6884 . . . . . . . . . 10 ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘𝑥) = (𝐹𝑥))
2423sseq2d 3970 . . . . . . . . 9 ((mrCls‘𝑧) = 𝐹 → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ↔ 𝑥 ⊆ (𝐹𝑥)))
25 fveq1 6884 . . . . . . . . . 10 ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘𝑦) = (𝐹𝑦))
2625, 23sseq12d 3971 . . . . . . . . 9 ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ↔ (𝐹𝑦) ⊆ (𝐹𝑥)))
27 id 23 . . . . . . . . . . 11 ((mrCls‘𝑧) = 𝐹 → (mrCls‘𝑧) = 𝐹)
2827, 23fveq12d 6892 . . . . . . . . . 10 ((mrCls‘𝑧) = 𝐹 → ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = (𝐹‘(𝐹𝑥)))
2928, 23eqeq12d 2781 . . . . . . . . 9 ((mrCls‘𝑧) = 𝐹 → (((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥) ↔ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))
3024, 26, 293anbi123d 1464 . . . . . . . 8 ((mrCls‘𝑧) = 𝐹 → ((𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)) ↔ (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))))
3130imbi2d 343 . . . . . . 7 ((mrCls‘𝑧) = 𝐹 → (((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))))
32312albidv 1956 . . . . . 6 ((mrCls‘𝑧) = 𝐹 → (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥))) ↔ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))))
3322, 323anbi23d 1467 . . . . 5 ((mrCls‘𝑧) = 𝐹 → ((𝐵 ∈ V ∧ (mrCls‘𝑧):𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘𝑦) ⊆ ((mrCls‘𝑧)‘𝑥) ∧ ((mrCls‘𝑧)‘((mrCls‘𝑧)‘𝑥)) = ((mrCls‘𝑧)‘𝑥)))) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))))))
3421, 33syl5ibcom 248 . . . 4 (𝑧 ∈ (Moore‘𝐵) → ((mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))))))
3534rexlimiv 3161 . . 3 (∃𝑧 ∈ (Moore‘𝐵)(mrCls‘𝑧) = 𝐹 → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))))
365, 35syl 18 . 2 (𝐹 ∈ (mrCls “ (Moore‘𝐵)) → (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))))
37 simp1 1154 . . . 4 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → 𝐵 ∈ V)
38 simp2 1155 . . . 4 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → 𝐹:𝒫 𝐵⟶𝒫 𝐵)
39 ssid 3960 . . . . . . 7 𝑧𝑧
40 3simpb 1167 . . . . . . . . . . 11 ((𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))
4140imim2i 17 . . . . . . . . . 10 (((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))))
42412alimi 1845 . . . . . . . . 9 (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))))
43 sseq1 3963 . . . . . . . . . . . . . 14 (𝑥 = 𝑧 → (𝑥𝐵𝑧𝐵))
4443adantr 486 . . . . . . . . . . . . 13 ((𝑥 = 𝑧𝑦 = 𝑧) → (𝑥𝐵𝑧𝐵))
45 sseq12 3965 . . . . . . . . . . . . . 14 ((𝑦 = 𝑧𝑥 = 𝑧) → (𝑦𝑥𝑧𝑧))
4645ancoms 464 . . . . . . . . . . . . 13 ((𝑥 = 𝑧𝑦 = 𝑧) → (𝑦𝑥𝑧𝑧))
4744, 46anbi12d 644 . . . . . . . . . . . 12 ((𝑥 = 𝑧𝑦 = 𝑧) → ((𝑥𝐵𝑦𝑥) ↔ (𝑧𝐵𝑧𝑧)))
48 id 23 . . . . . . . . . . . . . . 15 (𝑥 = 𝑧𝑥 = 𝑧)
49 fveq2 6885 . . . . . . . . . . . . . . 15 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
5048, 49sseq12d 3971 . . . . . . . . . . . . . 14 (𝑥 = 𝑧 → (𝑥 ⊆ (𝐹𝑥) ↔ 𝑧 ⊆ (𝐹𝑧)))
5150adantr 486 . . . . . . . . . . . . 13 ((𝑥 = 𝑧𝑦 = 𝑧) → (𝑥 ⊆ (𝐹𝑥) ↔ 𝑧 ⊆ (𝐹𝑧)))
52 2fveq3 6890 . . . . . . . . . . . . . . 15 (𝑥 = 𝑧 → (𝐹‘(𝐹𝑥)) = (𝐹‘(𝐹𝑧)))
5352, 49eqeq12d 2781 . . . . . . . . . . . . . 14 (𝑥 = 𝑧 → ((𝐹‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹‘(𝐹𝑧)) = (𝐹𝑧)))
5453adantr 486 . . . . . . . . . . . . 13 ((𝑥 = 𝑧𝑦 = 𝑧) → ((𝐹‘(𝐹𝑥)) = (𝐹𝑥) ↔ (𝐹‘(𝐹𝑧)) = (𝐹𝑧)))
5551, 54anbi12d 644 . . . . . . . . . . . 12 ((𝑥 = 𝑧𝑦 = 𝑧) → ((𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)) ↔ (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧))))
5647, 55imbi12d 347 . . . . . . . . . . 11 ((𝑥 = 𝑧𝑦 = 𝑧) → (((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) ↔ ((𝑧𝐵𝑧𝑧) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧)))))
5756spc2gv 3561 . . . . . . . . . 10 ((𝑧 ∈ V ∧ 𝑧 ∈ V) → (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ((𝑧𝐵𝑧𝑧) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧)))))
5857el2v 3464 . . . . . . . . 9 (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ((𝑧𝐵𝑧𝑧) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧))))
5942, 58syl 18 . . . . . . . 8 (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ((𝑧𝐵𝑧𝑧) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧))))
60593ad2ant3 1153 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → ((𝑧𝐵𝑧𝑧) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧))))
6139, 60mpan2i 710 . . . . . 6 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → (𝑧𝐵 → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧))))
6261imp 412 . . . . 5 (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) ∧ 𝑧𝐵) → (𝑧 ⊆ (𝐹𝑧) ∧ (𝐹‘(𝐹𝑧)) = (𝐹𝑧)))
6362simpld 500 . . . 4 (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) ∧ 𝑧𝐵) → 𝑧 ⊆ (𝐹𝑧))
64 simp2 1155 . . . . . . . . 9 ((𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)) → (𝐹𝑦) ⊆ (𝐹𝑥))
6564imim2i 17 . . . . . . . 8 (((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)))
66652alimi 1845 . . . . . . 7 (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥))) → ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)))
67663ad2ant3 1153 . . . . . 6 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)))
6843adantr 486 . . . . . . . . . 10 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝑥𝐵𝑧𝐵))
69 sseq12 3965 . . . . . . . . . . 11 ((𝑦 = 𝑤𝑥 = 𝑧) → (𝑦𝑥𝑤𝑧))
7069ancoms 464 . . . . . . . . . 10 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝑦𝑥𝑤𝑧))
7168, 70anbi12d 644 . . . . . . . . 9 ((𝑥 = 𝑧𝑦 = 𝑤) → ((𝑥𝐵𝑦𝑥) ↔ (𝑧𝐵𝑤𝑧)))
72 fveq2 6885 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝐹𝑦) = (𝐹𝑤))
73 sseq12 3965 . . . . . . . . . 10 (((𝐹𝑦) = (𝐹𝑤) ∧ (𝐹𝑥) = (𝐹𝑧)) → ((𝐹𝑦) ⊆ (𝐹𝑥) ↔ (𝐹𝑤) ⊆ (𝐹𝑧)))
7472, 49, 73syl2anr 609 . . . . . . . . 9 ((𝑥 = 𝑧𝑦 = 𝑤) → ((𝐹𝑦) ⊆ (𝐹𝑥) ↔ (𝐹𝑤) ⊆ (𝐹𝑧)))
7571, 74imbi12d 347 . . . . . . . 8 ((𝑥 = 𝑧𝑦 = 𝑤) → (((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)) ↔ ((𝑧𝐵𝑤𝑧) → (𝐹𝑤) ⊆ (𝐹𝑧))))
7675spc2gv 3561 . . . . . . 7 ((𝑧 ∈ V ∧ 𝑤 ∈ V) → (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)) → ((𝑧𝐵𝑤𝑧) → (𝐹𝑤) ⊆ (𝐹𝑧))))
7776el2v 3464 . . . . . 6 (∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝐹𝑦) ⊆ (𝐹𝑥)) → ((𝑧𝐵𝑤𝑧) → (𝐹𝑤) ⊆ (𝐹𝑧)))
7867, 77syl 18 . . . . 5 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → ((𝑧𝐵𝑤𝑧) → (𝐹𝑤) ⊆ (𝐹𝑧)))
79783impib 1134 . . . 4 (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) ∧ 𝑧𝐵𝑤𝑧) → (𝐹𝑤) ⊆ (𝐹𝑧))
8062simprd 501 . . . 4 (((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) ∧ 𝑧𝐵) → (𝐹‘(𝐹𝑧)) = (𝐹𝑧))
8137, 38, 63, 79, 80ismrcd2 43490 . . 3 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → 𝐹 = (mrCls‘dom (𝐹 ∩ I )))
8237, 38, 63, 79, 80ismrcd1 43489 . . . 4 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → dom (𝐹 ∩ I ) ∈ (Moore‘𝐵))
83 fvssunirn 6916 . . . . . 6 (Moore‘𝐵) ⊆ ran Moore
841fndmi 6643 . . . . . 6 dom mrCls = ran Moore
8583, 84sseqtrri 3987 . . . . 5 (Moore‘𝐵) ⊆ dom mrCls
86 funfvima2 7236 . . . . 5 ((Fun mrCls ∧ (Moore‘𝐵) ⊆ dom mrCls) → (dom (𝐹 ∩ I ) ∈ (Moore‘𝐵) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵))))
873, 85, 86mp2an 705 . . . 4 (dom (𝐹 ∩ I ) ∈ (Moore‘𝐵) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵)))
8882, 87syl 18 . . 3 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → (mrCls‘dom (𝐹 ∩ I )) ∈ (mrCls “ (Moore‘𝐵)))
8981, 88eqeltrd 2865 . 2 ((𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))) → 𝐹 ∈ (mrCls “ (Moore‘𝐵)))
9036, 89impbii 212 1 (𝐹 ∈ (mrCls “ (Moore‘𝐵)) ↔ (𝐵 ∈ V ∧ 𝐹:𝒫 𝐵⟶𝒫 𝐵 ∧ ∀𝑥𝑦((𝑥𝐵𝑦𝑥) → (𝑥 ⊆ (𝐹𝑥) ∧ (𝐹𝑦) ⊆ (𝐹𝑥) ∧ (𝐹‘(𝐹𝑥)) = (𝐹𝑥)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103  wal 1568   = wceq 1570  wcel 2146  wrex 3091  Vcvv 3457  cin 3905  wss 3906  𝒫 cpw 4564   cuni 4874   I cid 5557  dom cdm 5663  ran crn 5664  cima 5666  Fun wfun 6534   Fn wfn 6535  wf 6536  cfv 6540  Moorecmre 17658  mrClscmrc 17659
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-mre 17662  df-mrc 17663
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator