All three facts follow from facts about maps between classes: values of a map lie in its codomain, maps with equal values are equal, and the pairs in a map are exactly its argument-value pairs.
The "in particular" readings follow because a sequence in a set is a map whose -th term is its value at (Sequences (i)).
Proof of (i). Let and let be a map. Every value lies in (Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i)), hence in , so is a map by Membership in Inverse Relations, Preimages and Images of Classes, and Enlarging the Codomain of a Map (v), applied to with domain , codomain and .
Proof of (ii). The maps and have the same domain and equal values at every , so by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii), applied to and with both codomains .
Proof of (iii). Let be a map and a class. By Relations, Domain, Range, Inverse and Composition (iii) and Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), a set lies in if and only if for some set .
Suppose . Then (as an element of a class, is a set by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (i)) there is a set with . By Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ii), this gives and .
Conversely, let with . By Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (i), is a set and , so by the description of the range above; that is, .
Loadingβ¦