哪位能给理解下: % U! _) |1 t$ F, V* L , S" s/ o0 z$ }7 VFormal Sets * }1 E8 g3 e' N0 E+ c6 rA formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. 0 ]1 F. p2 t2 s+ [
9 L- I8 O) t. \# nThe only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. ) b$ d7 V4 Y$ K: K $ }; R2 j7 {2 P$ p % B: I; V1 b; y / G" v, h& K% Q6 h6 zS := { 1 .. 5}; - L y4 I' Z) B* S2 B5 e> P := PowerSet(S);8 G7 V) x9 O6 V) A, p9 M U
P;6 a1 ^- H2 c6 e! q, K1 z
PFS:=PowerFormalSet(S);2 s+ k8 [4 B# A* \! b3 w
PFS; % o. ]9 \. g% y* A4 P$ UF := { 2, 4 }; * H8 r9 Q; }) B* T) HFF := { 2/3, 4 };7 \% ^" B" R/ g. X8 L5 L
- n) Z2 [# Y0 Y5 M, s3 v
F in P; % D9 r$ c* S* |9 CFF in P;8 p5 `" c# f0 W3 Q
F in PFS;2 e7 E- B" m: V5 z* k* }7 A2 M; ?
FF in PFS; 1 t/ u! } Q/ {+ L x* ?; `$ DSet of subsets of { 1 .. 5 }' H% C, ]" R5 S+ a
Set of formal subsets of { 1 .. 5 } % L; y$ k* s2 m3 }true* p$ {: Z2 U) Y( t
false * Y8 z2 ?, p& `2 I x8 N% C9 K' M& c5 v7 l* s) R, t# H7 l
>> F in PFS;* B. l+ a6 ~2 I1 c8 i* b8 o) u
^5 M& m9 W$ e( @9 e: _ N7 \
Runtime error in 'in': Bad argument types * {6 v. w5 W9 ^1 k. F0 c/ e6 J6 E2 J- D9 Y! H* f+ A& \
# }- K% j2 w% s- I! o>> FF in PFS; ( |+ u6 H& n/ K) h4 N ^ / I3 ]6 w2 N- d: e8 d, S+ W1 bRuntime error in 'in': Bad argument types