哪位能给理解下:: A0 O9 _* G* I! f9 t1 h
. m0 ]" r. d8 \& p/ F2 M6 }
Formal Sets0 u# V6 H3 F) y" I$ g
A formal set consists of the subset of elements of some carrier set (structure) on which a certain predicate assumes the value `true'. : O0 K2 }7 S* v* F- a" t3 D* ]; o- C2 l. L2 O. y
The only set-theoretic operations that can be performed on formal sets are union, intersection, difference and symmetric difference, and element membership testing. / {8 D- h V/ K7 G/ y7 n. A7 F- Q" w' v
. \$ |; T6 f& K- o* l7 T
2 K- a: Z" } z+ E' Z1 u
S := { 1 .. 5}; 1 `. \, O0 s0 F# f( L> P := PowerSet(S);9 t l4 r+ F7 ^& v/ p1 w
P; , a, u4 j! L9 S' GPFS:=PowerFormalSet(S); " w# T* W( Z7 m- K, N! KPFS;9 s: I& |' V5 E. }+ W
F := { 2, 4 };: `0 T6 j, |/ U) i
FF := { 2/3, 4 }; # f; n0 C" D. e. q q( m- i+ [6 Y4 J' n9 Z/ k
F in P; ( @ l2 @8 c" S$ X, n& JFF in P; + u4 T* G% F* F, ] F in PFS; 6 b) s; U( b# N; `% t, A* qFF in PFS;4 |! T& Z' ^3 i- ^) ]) c$ i+ r) B( Y
Set of subsets of { 1 .. 5 } 0 }, W3 b: v* i' v) `Set of formal subsets of { 1 .. 5 }' q( N/ \1 a& I/ ]( i
true* B, X0 R7 k! g
false0 o0 X, z! Q; z% x1 f8 E
* S ~# @+ Y( l# W [>> F in PFS;4 r% b, O% l% O
^ ' \2 p& s; n) d" j" E7 s' Q3 ?Runtime error in 'in': Bad argument types 7 j. z1 B2 o& R* [$ `6 R ; M+ R# R( [, L & a$ a j, @2 p, e" w>> FF in PFS; : M. \+ i$ c6 t% \ ^$ X* k' Q# u) A% Z
Runtime error in 'in': Bad argument types