%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU713^2 : TPTP v6.1.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n108.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:32:54 EDT 2014

% Result   : Timeout 300.10s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU713^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n108.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 11:16:46 CDT 2014
% % CPUTime  : 300.10 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x188e320>, <kernel.DependentProduct object at 0x188e710>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1aefb90>, <kernel.DependentProduct object at 0x188eb00>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x188e368>, <kernel.Sort object at 0x1948878>) of role type named powersetI_type
% Using role type
% Declaring powersetI:Prop
% FOF formula (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))) of role definition named powersetI
% A new definition: (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))))
% Defined: powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))
% FOF formula (<kernel.Constant object at 0x188e560>, <kernel.Sort object at 0x1948878>) of role type named powersetE_type
% Using role type
% Declaring powersetE:Prop
% FOF formula (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))) of role definition named powersetE
% A new definition: (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))))
% Defined: powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))
% FOF formula (<kernel.Constant object at 0x188e320>, <kernel.DependentProduct object at 0x188e518>) of role type named setminus_type
% Using role type
% Declaring setminus:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x188e710>, <kernel.Sort object at 0x1948878>) of role type named setminusEL_type
% Using role type
% Declaring setminusEL:Prop
% FOF formula (((eq Prop) setminusEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A)))) of role definition named setminusEL
% A new definition: (((eq Prop) setminusEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A))))
% Defined: setminusEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A)))
% FOF formula (powersetI->(powersetE->(setminusEL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus X) Y)) (powerset A))))))))) of role conjecture named setminusT_lem
% Conjecture to prove = (powersetI->(powersetE->(setminusEL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus X) Y)) (powerset A))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(powersetI->(powersetE->(setminusEL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus X) Y)) (powerset A)))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Definition powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))):Prop.
% Definition powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))):Prop.
% Parameter setminus:(fofType->(fofType->fofType)).
% Definition setminusEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A))):Prop.
% Trying to prove (powersetI->(powersetE->(setminusEL->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus X) Y)) (powerset A)))))))))
% Found x5:((in Xx) B)
% Instantiate: B:=(powerset A):fofType
% Found (fun (x5:((in Xx) B))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B))=> x5) as proof of (((in Xx) B)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B))=> x5)) as proof of ((in B) (powerset (powerset A)))
% Found ((x4 B) (fun (Xx:fofType) (x5:((in Xx) B))=> x5)) as proof of ((in B) (powerset (powerset A)))
% Found (((x (powerset A)) B) (fun (Xx:fofType) (x5:((in Xx) B))=> x5)) as proof of ((in B) (powerset (powerset A)))
% Found (((x (powerset A)) B) (fun (Xx:fofType) (x5:((in Xx) B))=> x5)) as proof of ((in B) (powerset (powerset A)))
% Found x5:((in Xx) ((setminus X) Y))
% Found x5 as proof of ((in Xx) ((setminus X) Y))
% Found x5:((in Xx) B0)
% Instantiate: B0:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B0))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (((in Xx) B0)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B0)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B0)
% Instantiate: B0:=(powerset A):fofType
% Found (fun (x5:((in Xx) B0))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (((in Xx) B0)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B0)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found ((x4 B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found (((x (powerset A)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found (((x (powerset A)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found x5:((in Xx) B0)
% Instantiate: B0:=(powerset A):fofType
% Found (fun (x5:((in Xx) B0))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (((in Xx) B0)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B0))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B0)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found ((x4 B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found (((x (powerset A)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found (((x (powerset A)) B0) (fun (Xx:fofType) (x5:((in Xx) B0))=> x5)) as proof of ((in B0) (powerset (powerset A)))
% Found x5:((in Xx) B00)
% Instantiate: B00:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B00))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B00)
% Instantiate: B00:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B00))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B1)
% Instantiate: B1:=(powerset A):fofType
% Found (fun (x5:((in Xx) B1))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (((in Xx) B1)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B1)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found ((x4 B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found x5:((in Xx) B1)
% Instantiate: B1:=(powerset A):fofType
% Found (fun (x5:((in Xx) B1))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (((in Xx) B1)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B1)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found ((x4 B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found x5:((in Xx) B1)
% Instantiate: B1:=(powerset A):fofType
% Found (fun (x5:((in Xx) B1))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (((in Xx) B1)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B1)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found ((x4 B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found x5:((in Xx) B1)
% Instantiate: B1:=(powerset A):fofType
% Found (fun (x5:((in Xx) B1))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (((in Xx) B1)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B1))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B1)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found ((x4 B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found (((x (powerset A)) B1) (fun (Xx:fofType) (x5:((in Xx) B1))=> x5)) as proof of ((in B1) (powerset (powerset A)))
% Found x5:((in Xx) B00)
% Instantiate: B00:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B00))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B00))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B00)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B00) (fun (Xx:fofType) (x5:((in Xx) B00))=> x5)) as proof of ((in B00) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B2)
% Instantiate: B2:=(powerset A):fofType
% Found (fun (x5:((in Xx) B2))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (((in Xx) B2)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B2))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B2)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found ((x4 B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found (((x (powerset A)) B2) (fun (Xx:fofType) (x5:((in Xx) B2))=> x5)) as proof of ((in B2) (powerset (powerset A)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B3)
% Instantiate: B3:=(powerset A):fofType
% Found (fun (x5:((in Xx) B3))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (((in Xx) B3)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B3))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B3)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found ((x4 B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found (((x (powerset A)) B3) (fun (Xx:fofType) (x5:((in Xx) B3))=> x5)) as proof of ((in B3) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B01)
% Instantiate: B01:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B01))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B01))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B01)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B01) (fun (Xx:fofType) (x5:((in Xx) B01))=> x5)) as proof of ((in B01) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B4)
% Instantiate: B4:=(powerset A):fofType
% Found (fun (x5:((in Xx) B4))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (((in Xx) B4)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B4))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B4)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found ((x4 B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found (((x (powerset A)) B4) (fun (Xx:fofType) (x5:((in Xx) B4))=> x5)) as proof of ((in B4) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B5)
% Instantiate: B5:=(powerset A):fofType
% Found (fun (x5:((in Xx) B5))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (((in Xx) B5)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B5))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B5)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found ((x4 B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found (((x (powerset A)) B5) (fun (Xx:fofType) (x5:((in Xx) B5))=> x5)) as proof of ((in B5) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B02)
% Instantiate: B02:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B02))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B02))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B02)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B02) (fun (Xx:fofType) (x5:((in Xx) B02))=> x5)) as proof of ((in B02) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B6)
% Instantiate: B6:=(powerset A):fofType
% Found (fun (x5:((in Xx) B6))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (((in Xx) B6)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B6))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B6)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found ((x4 B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found (((x (powerset A)) B6) (fun (Xx:fofType) (x5:((in Xx) B6))=> x5)) as proof of ((in B6) (powerset (powerset A)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B05)
% Instantiate: B05:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B05))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B05))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B05)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B05) (fun (Xx:fofType) (x5:((in Xx) B05))=> x5)) as proof of ((in B05) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B03)
% Instantiate: B03:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B03))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B03))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B03)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B03) (fun (Xx:fofType) (x5:((in Xx) B03))=> x5)) as proof of ((in B03) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B04)
% Instantiate: B04:=((setminus (powerset A)) B):fofType
% Found (fun (x5:((in Xx) B04))=> x5) as proof of ((in Xx) ((setminus (powerset A)) B))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B)))
% Found (fun (Xx:fofType) (x5:((in Xx) B04))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B04)->((in Xx) ((setminus (powerset A)) B))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found ((x4 B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found (((x ((setminus (powerset A)) B)) B04) (fun (Xx:fofType) (x5:((in Xx) B04))=> x5)) as proof of ((in B04) (powerset ((setminus (powerset A)) B)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found ((x4 B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found (((x (powerset A)) B7) (fun (Xx:fofType) (x5:((in Xx) B7))=> x5)) as proof of ((in B7) (powerset (powerset A)))
% Found x5:((in Xx) B7)
% Instantiate: B7:=(powerset A):fofType
% Found (fun (x5:((in Xx) B7))=> x5) as proof of ((in Xx) (powerset A))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (((in Xx) B7)->((in Xx) (powerset A)))
% Found (fun (Xx:fofType) (x5:((in Xx) B7))=> x5) as proof of (forall (Xx:fofType), (((in Xx) B7)->((in Xx) (powerset A))))
% Found (x40 (fun (Xx:fofType) (x5:((in Xx)
% EOF
%------------------------------------------------------------------------------