MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isacs1i Structured version   Visualization version   GIF version

Theorem isacs1i 17537
Description: A closure system determined by a function is a closure system and algebraic. (Contributed by Stefan O'Rear, 3-Apr-2015.)
Assertion
Ref Expression
isacs1i ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋))
Distinct variable groups:   𝐹,𝑠   𝑋,𝑠
Allowed substitution hint:   𝑉(𝑠)

Proof of Theorem isacs1i
Dummy variables 𝑎 𝑡 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssrab2 4037 . . . 4 {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋
21a1i 11 . . 3 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ⊆ 𝒫 𝑋)
3 pweq 4574 . . . . . . . 8 (𝑠 = (𝑋 𝑡) → 𝒫 𝑠 = 𝒫 (𝑋 𝑡))
43ineq1d 4171 . . . . . . 7 (𝑠 = (𝑋 𝑡) → (𝒫 𝑠 ∩ Fin) = (𝒫 (𝑋 𝑡) ∩ Fin))
54imaeq2d 6013 . . . . . 6 (𝑠 = (𝑋 𝑡) → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)))
65unieqd 4879 . . . . 5 (𝑠 = (𝑋 𝑡) → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)))
7 id 22 . . . . 5 (𝑠 = (𝑋 𝑡) → 𝑠 = (𝑋 𝑡))
86, 7sseq12d 3977 . . . 4 (𝑠 = (𝑋 𝑡) → ( (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ (𝑋 𝑡)))
9 inss1 4188 . . . . . 6 (𝑋 𝑡) ⊆ 𝑋
10 elpw2g 5301 . . . . . 6 (𝑋𝑉 → ((𝑋 𝑡) ∈ 𝒫 𝑋 ↔ (𝑋 𝑡) ⊆ 𝑋))
119, 10mpbiri 257 . . . . 5 (𝑋𝑉 → (𝑋 𝑡) ∈ 𝒫 𝑋)
1211ad2antrr 724 . . . 4 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 𝑡) ∈ 𝒫 𝑋)
13 imassrn 6024 . . . . . . . . 9 (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ ran 𝐹
14 frn 6675 . . . . . . . . . 10 (𝐹:𝒫 𝑋⟶𝒫 𝑋 → ran 𝐹 ⊆ 𝒫 𝑋)
1514adantl 482 . . . . . . . . 9 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → ran 𝐹 ⊆ 𝒫 𝑋)
1613, 15sstrid 3955 . . . . . . . 8 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝒫 𝑋)
1716unissd 4875 . . . . . . 7 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝒫 𝑋)
18 unipw 5407 . . . . . . 7 𝒫 𝑋 = 𝑋
1917, 18sseqtrdi 3994 . . . . . 6 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑋)
2019adantr 481 . . . . 5 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑋)
21 inss2 4189 . . . . . . . . . . . . . 14 (𝑋 𝑡) ⊆ 𝑡
22 intss1 4924 . . . . . . . . . . . . . 14 (𝑎𝑡 𝑡𝑎)
2321, 22sstrid 3955 . . . . . . . . . . . . 13 (𝑎𝑡 → (𝑋 𝑡) ⊆ 𝑎)
2423adantl 482 . . . . . . . . . . . 12 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝑋 𝑡) ⊆ 𝑎)
2524sspwd 4573 . . . . . . . . . . 11 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → 𝒫 (𝑋 𝑡) ⊆ 𝒫 𝑎)
2625ssrind 4195 . . . . . . . . . 10 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝒫 (𝑋 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin))
27 imass2 6054 . . . . . . . . . 10 ((𝒫 (𝑋 𝑡) ∩ Fin) ⊆ (𝒫 𝑎 ∩ Fin) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
2826, 27syl 17 . . . . . . . . 9 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
2928unissd 4875 . . . . . . . 8 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ (𝐹 “ (𝒫 𝑎 ∩ Fin)))
30 ssel2 3939 . . . . . . . . . 10 ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎𝑡) → 𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
31 pweq 4574 . . . . . . . . . . . . . . . 16 (𝑠 = 𝑎 → 𝒫 𝑠 = 𝒫 𝑎)
3231ineq1d 4171 . . . . . . . . . . . . . . 15 (𝑠 = 𝑎 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑎 ∩ Fin))
3332imaeq2d 6013 . . . . . . . . . . . . . 14 (𝑠 = 𝑎 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑎 ∩ Fin)))
3433unieqd 4879 . . . . . . . . . . . . 13 (𝑠 = 𝑎 (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑎 ∩ Fin)))
35 id 22 . . . . . . . . . . . . 13 (𝑠 = 𝑎𝑠 = 𝑎)
3634, 35sseq12d 3977 . . . . . . . . . . . 12 (𝑠 = 𝑎 → ( (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
3736elrab 3645 . . . . . . . . . . 11 (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑎 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎))
3837simprbi 497 . . . . . . . . . 10 (𝑎 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} → (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
3930, 38syl 17 . . . . . . . . 9 ((𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∧ 𝑎𝑡) → (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
4039adantll 712 . . . . . . . 8 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝐹 “ (𝒫 𝑎 ∩ Fin)) ⊆ 𝑎)
4129, 40sstrd 3954 . . . . . . 7 ((((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) ∧ 𝑎𝑡) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑎)
4241ralrimiva 3143 . . . . . 6 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → ∀𝑎𝑡 (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑎)
43 ssint 4925 . . . . . 6 ( (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑡 ↔ ∀𝑎𝑡 (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑎)
4442, 43sylibr 233 . . . . 5 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ 𝑡)
4520, 44ssind 4192 . . . 4 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝐹 “ (𝒫 (𝑋 𝑡) ∩ Fin)) ⊆ (𝑋 𝑡))
468, 12, 45elrabd 3647 . . 3 (((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) ∧ 𝑡 ⊆ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠}) → (𝑋 𝑡) ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠})
472, 46ismred2 17483 . 2 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋))
48 fssxp 6696 . . . 4 (𝐹:𝒫 𝑋⟶𝒫 𝑋𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋))
49 pwexg 5333 . . . . 5 (𝑋𝑉 → 𝒫 𝑋 ∈ V)
5049, 49xpexd 7685 . . . 4 (𝑋𝑉 → (𝒫 𝑋 × 𝒫 𝑋) ∈ V)
51 ssexg 5280 . . . 4 ((𝐹 ⊆ (𝒫 𝑋 × 𝒫 𝑋) ∧ (𝒫 𝑋 × 𝒫 𝑋) ∈ V) → 𝐹 ∈ V)
5248, 50, 51syl2anr 597 . . 3 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹 ∈ V)
53 simpr 485 . . . 4 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → 𝐹:𝒫 𝑋⟶𝒫 𝑋)
54 pweq 4574 . . . . . . . . . 10 (𝑠 = 𝑡 → 𝒫 𝑠 = 𝒫 𝑡)
5554ineq1d 4171 . . . . . . . . 9 (𝑠 = 𝑡 → (𝒫 𝑠 ∩ Fin) = (𝒫 𝑡 ∩ Fin))
5655imaeq2d 6013 . . . . . . . 8 (𝑠 = 𝑡 → (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
5756unieqd 4879 . . . . . . 7 (𝑠 = 𝑡 (𝐹 “ (𝒫 𝑠 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
58 id 22 . . . . . . 7 (𝑠 = 𝑡𝑠 = 𝑡)
5957, 58sseq12d 3977 . . . . . 6 (𝑠 = 𝑡 → ( (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠 (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
6059elrab3 3646 . . . . 5 (𝑡 ∈ 𝒫 𝑋 → (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
6160rgen 3066 . . . 4 𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)
6253, 61jctir 521 . . 3 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
63 feq1 6649 . . . 4 (𝑓 = 𝐹 → (𝑓:𝒫 𝑋⟶𝒫 𝑋𝐹:𝒫 𝑋⟶𝒫 𝑋))
64 imaeq1 6008 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓 “ (𝒫 𝑡 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
6564unieqd 4879 . . . . . . 7 (𝑓 = 𝐹 (𝑓 “ (𝒫 𝑡 ∩ Fin)) = (𝐹 “ (𝒫 𝑡 ∩ Fin)))
6665sseq1d 3975 . . . . . 6 (𝑓 = 𝐹 → ( (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡 (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))
6766bibi2d 342 . . . . 5 (𝑓 = 𝐹 → ((𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ (𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
6867ralbidv 3174 . . . 4 (𝑓 = 𝐹 → (∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡) ↔ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
6963, 68anbi12d 631 . . 3 (𝑓 = 𝐹 → ((𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)) ↔ (𝐹:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝐹 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
7052, 62, 69spcedv 3557 . 2 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡)))
71 isacs 17531 . 2 ({𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋) ↔ ({𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (Moore‘𝑋) ∧ ∃𝑓(𝑓:𝒫 𝑋⟶𝒫 𝑋 ∧ ∀𝑡 ∈ 𝒫 𝑋(𝑡 ∈ {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ↔ (𝑓 “ (𝒫 𝑡 ∩ Fin)) ⊆ 𝑡))))
7247, 70, 71sylanbrc 583 1 ((𝑋𝑉𝐹:𝒫 𝑋⟶𝒫 𝑋) → {𝑠 ∈ 𝒫 𝑋 (𝐹 “ (𝒫 𝑠 ∩ Fin)) ⊆ 𝑠} ∈ (ACS‘𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  wral 3064  {crab 3407  Vcvv 3445  cin 3909  wss 3910  𝒫 cpw 4560   cuni 4865   cint 4907   × cxp 5631  ran crn 5634  cima 5636  wf 6492  cfv 6496  Fincfn 8883  Moorecmre 17462  ACScacs 17465
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-mre 17466  df-acs 17469
This theorem is referenced by:  acsfn  17539
  Copyright terms: Public domain W3C validator