哪位能给理解下: & A8 O' n# J0 U' F ~ B* I' n) P0 I6 \2 N3 m0 u
Formal Sets ; r5 L' R, ^5 z8 t; C+ l9 O( dA formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. @! y/ P9 V! ~- I2 l7 R" W) M
; r& T, m" h" }, j) i) [The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. . q4 ?. ~; q+ D+ O9 @' c
) k4 U6 @, O" b% o8 |1 W1 N ' G1 B& `- i8 W1 A 5 E) S7 K! P* y$ a4 CS := { 1 .. 5}; * E: O, ^, Z1 ?7 ]# H6 X, R7 }> P := PowerSet(S);" a5 C+ w, V' H: K& f2 I9 c. X. i
P; - J1 D: m; r# e3 G* SPFS:=PowerFormalSet(S); & s5 Q+ }. ?! ~- e2 _, O& D/ yPFS; 5 g0 p: s3 }6 Y8 a$ d/ Z/ xF := { 2, 4 };/ f4 `. z- m7 ^: K+ P( N% p( q
FF := { 2/3, 4 }; % l4 E9 u) D! r7 Z$ m9 }+ }/ ]/ }$ v, d, V' [7 ^' U4 C
F in P; 0 g+ d6 e7 j5 I9 T ?2 o% UFF in P;* F5 E5 s2 D. W" M
F in PFS; & g# F7 h/ a- oFF in PFS; + } Y1 p" e) B, xSet of subsets of { 1 .. 5 }/ y+ T# f$ w- P7 y! i
Set of formal subsets of { 1 .. 5 } + d7 z r7 R0 H6 V1 T5 v- {- n$ S& `8 xtrue- _6 p: L. b3 e2 E7 g: J
false " Q$ n f* p$ R" x9 p0 Q3 p2 `8 z; m2 j5 j8 f) y y
>> F in PFS;4 W6 v/ t2 z' ]0 f. M5 F
^ ' L- q9 q4 T" _: B: o& DRuntime error in 'in': Bad argument types3 s' v# T0 a& Y% l1 P! S
$ o ]* _4 J' N/ J' B5 E
& x% C5 S/ H& c- A9 V
>> FF in PFS;: [3 F0 e. v* A$ M, F+ T) {* e0 O
^; @: a5 J+ ?; F# G$ N
Runtime error in 'in': Bad argument types