哪位能给理解下: % l( |4 N- q0 S& p: B1 R; \+ n& C; O( ~6 g
Formal Sets2 _" c8 F8 A; U8 O' Z
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. 3 X& n9 S; ]( l) W
; f7 k& v! J! O6 j2 z* e- A: H+ E
The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. 6 v- V% k+ s9 j: u
G! L4 g2 }3 R* X& _9 \
) R0 ~; J K+ H/ p3 T) _" P* U, d4 n
S := { 1 .. 5}; * l" k# l3 E7 X$ C> P := PowerSet(S); 7 V O$ C. N, S; ?5 O/ M2 IP;2 c3 m1 I: k8 W4 O0 ]+ m
PFS:=PowerFormalSet(S);7 \* S0 L2 f2 v) ~7 w8 Y2 k
PFS;, G R6 f/ r9 r r3 C) t
F := { 2, 4 };! W$ N0 r% D1 f& H' Y( {: E7 X; j
FF := { 2/3, 4 };0 I0 ?- A+ T% s3 l7 R% v8 K7 o
& H* c/ `5 [% H# l6 o- H$ X
F in P; 2 m5 T1 s/ p: X. F! d5 ~FF in P;+ Z- N: u) g) d, y" W
F in PFS; " k' h2 R# O! n$ j6 XFF in PFS; / U8 E. j; P7 Q7 I2 I# W7 F+ ASet of subsets of { 1 .. 5 } * A7 _" F; o" V6 o V+ LSet of formal subsets of { 1 .. 5 }8 Y1 \! ~/ D! y6 r: [! L4 V
true# g. ? ^/ l, a1 ]% i
false: Z; l8 I4 U/ l' k; k) x
: Q; l8 p; D4 p% e" ?>> F in PFS;* _: a6 F) o z8 b
^! G# T: H- X' F- }5 V
Runtime error in 'in': Bad argument types, T2 u0 H2 N5 U0 l9 F, W
6 [! a8 z# { f( m3 C& s& v- }: t w+ ?
>> FF in PFS; # v- X6 V/ `0 B+ x: ]3 }9 w. S ^ ; H# v: J% Q% G5 }3 yRuntime error in 'in': Bad argument types