TheoremBase

Both identities follow by comparing members, using that inclusion of classes is transitive, and the second then reduces to restricting a restriction.

Proof

Throughout, for classes G\mathcal{G} and SS and a set CC, C∈GSC\in\mathcal{G}_{S} holds if and only if C∈GC\in\mathcal{G} and CβŠ†SC\subseteq S, by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii).

Proof of (i). Let AβŠ†XA\subseteq X and let CC be a set. Then C∈(FX)AC\in(\mathcal{F}_{X})_{A} if and only if C∈FC\in\mathcal{F}, CβŠ†XC\subseteq X and CβŠ†AC\subseteq A, while C∈FAC\in\mathcal{F}_{A} if and only if C∈FC\in\mathcal{F} and CβŠ†AC\subseteq A. Since CβŠ†AC\subseteq A and AβŠ†XA\subseteq X give CβŠ†XC\subseteq X (βŠ†\subseteq is transitive, by Subclasses and Subsets (i)), the two conditions are equivalent. Hence (FX)A=FA(\mathcal{F}_{X})_{A}=\mathcal{F}_{A} by Axiom of Extensionality for Classes.

Proof of (ii). Let BβŠ†AB\subseteq A. By (i), applied with AA in place of XX and BB in place of AA,

(FA)B=FB.(\mathcal{F}_{A})_{B}=\mathcal{F}_{B}.

Moreover FBβŠ†FA\mathcal{F}_{B}\subseteq\mathcal{F}_{A}: an element CC of FB\mathcal{F}_{B} satisfies C∈FC\in\mathcal{F} and CβŠ†BC\subseteq B, hence CβŠ†AC\subseteq A (βŠ†\subseteq is transitive, by Subclasses and Subsets (i)), so C∈FAC\in\mathcal{F}_{A}. Therefore, by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iv) with H=ΞΌH=\mu, S=FAS=\mathcal{F}_{A} and T=FBT=\mathcal{F}_{B},

(μA)∣(FA)B=(μ∣FA)∣FB=μ∣FB=μB.(\mu_{A})|_{(\mathcal{F}_{A})_{B}}=(\mu|_{\mathcal{F}_{A}})|_{\mathcal{F}_{B}}=\mu|_{\mathcal{F}_{B}}=\mu_{B}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…