哪位能给理解下: ( T/ b( Y& {( H5 T# v3 u1 L+ Z # t2 G7 u, r7 K$ FFormal Sets! |, H6 n7 C' V" i+ S H( U& x0 d
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. & B8 X* }( m( g) E. | E& H# n$ n- G+ {) K
The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. ! K6 S: `, B* A, [; g& e } # ^% A" W8 F, w r% J6 ]; j2 i& {/ Q5 q5 Z' S7 {" r
& t& N) X1 |' {# p' k
S := { 1 .. 5};# A d4 }$ Y) f0 h% j" s- ^8 }
> P := PowerSet(S);5 ?, O! c- N5 k) [/ _9 b
P;5 |+ G) Z9 F: N, `* E9 p
PFS:=PowerFormalSet(S);0 K7 J9 Z$ I0 l
PFS;2 V9 N8 c( R# m' T3 G% q; C% T2 i
F := { 2, 4 }; 7 b' a6 e) r5 g9 [- f& {% uFF := { 2/3, 4 }; d# e' S: z$ x2 Y) s
+ L* F$ i5 y2 z7 R5 L; M F in P; 1 ^( q5 F& R6 P5 f7 {$ k* ? j/ AFF in P; / [7 {; w- M+ d( W1 e K F in PFS;) [+ s$ ?! a7 L& `6 v
FF in PFS; & s+ M6 i; k/ v$ a aSet of subsets of { 1 .. 5 }5 I, n, ?% C2 L9 q7 {+ O* B
Set of formal subsets of { 1 .. 5 }+ Z1 N1 a- F: z' g; O
true 0 f: u3 S$ w" Z- P; Q9 zfalse ' x- @3 C* A. t. y, S: Q) p5 \ 2 ~, r* ~8 s- ^! z9 m>> F in PFS; " x$ G5 p0 k0 j' ^) ? ^& {- G: ~* G" i; W
Runtime error in 'in': Bad argument types' R2 ?1 ~% [8 t# W' ?7 ?
" ~: m! q) p* A$ s7 m E/ t3 f T; o; D1 B: c: y1 n>> FF in PFS; # P' r: d& l( R B N ^ $ y; o, |. G* z7 j( y, ^Runtime error in 'in': Bad argument types