P. 372 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 37101-37200   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	inres2 37101	Two ways of expressing the restriction of an intersection. (Contributed by Peter Mazsa, 5-Jun-2021.)
⊢ ((𝑅 ↾ 𝐴) ∩ 𝑆) = ((𝑅 ∩ 𝑆) ↾ 𝐴)
Theorem	coideq 37102	Equality theorem for composition of two classes. (Contributed by Peter Mazsa, 23-Sep-2021.)
⊢ (𝐴 = 𝐵 → (𝐴 ∘ 𝐴) = (𝐵 ∘ 𝐵))
Theorem	nexmo1 37103	If there is no case where wff is true, it is true for at most one case. (Contributed by Peter Mazsa, 27-Sep-2021.)
⊢ (¬ ∃𝑥𝜑 → ∃*𝑥𝜑)
Theorem	ralin 37104	Restricted universal quantification over intersection. (Contributed by Peter Mazsa, 8-Sep-2023.)
⊢ (∀𝑥 ∈ (𝐴 ∩ 𝐵)𝜑 ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑))
Theorem	r2alan 37105*	Double restricted universal quantification, special case. (Contributed by Peter Mazsa, 17-Jun-2020.)
⊢ (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜑) → 𝜓) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝜓))
Theorem	ssrabi 37106	Inference of restricted abstraction subclass from implication. (Contributed by Peter Mazsa, 26-Oct-2022.)
⊢ (𝜑 → 𝜓)    ⇒   ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ {𝑥 ∈ 𝐴 ∣ 𝜓}
Theorem	rabbieq 37107	Equivalent wff's correspond to restricted class abstractions which are equal with the same class. (Contributed by Peter Mazsa, 8-Jul-2019.)
⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑}    &   ⊢ (𝜑 ↔ 𝜓)    ⇒   ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜓}
Theorem	rabimbieq 37108	Restricted equivalent wff's correspond to restricted class abstractions which are equal with the same class. (Contributed by Peter Mazsa, 22-Jul-2021.)
⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑}    &   ⊢ (𝑥 ∈ 𝐴 → (𝜑 ↔ 𝜓))    ⇒   ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜓}
Theorem	abeqin 37109*	Intersection with class abstraction. (Contributed by Peter Mazsa, 21-Jul-2021.)
⊢ 𝐴 = (𝐵 ∩ 𝐶)    &   ⊢ 𝐵 = {𝑥 ∣ 𝜑}    ⇒   ⊢ 𝐴 = {𝑥 ∈ 𝐶 ∣ 𝜑}
Theorem	abeqinbi 37110*	Intersection with class abstraction and equivalent wff's. (Contributed by Peter Mazsa, 21-Jul-2021.)
⊢ 𝐴 = (𝐵 ∩ 𝐶)    &   ⊢ 𝐵 = {𝑥 ∣ 𝜑}    &   ⊢ (𝑥 ∈ 𝐶 → (𝜑 ↔ 𝜓))    ⇒   ⊢ 𝐴 = {𝑥 ∈ 𝐶 ∣ 𝜓}
Theorem	rabeqel 37111*	Class element of a restricted class abstraction. (Contributed by Peter Mazsa, 24-Jul-2021.)
⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑}    &   ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜓))    ⇒   ⊢ (𝐶 ∈ 𝐵 ↔ (𝜓 ∧ 𝐶 ∈ 𝐴))
Theorem	eqrelf 37112*	The equality connective between relations. (Contributed by Peter Mazsa, 25-Jun-2019.)
⊢ Ⅎ𝑥𝐴    &   ⊢ Ⅎ𝑥𝐵    &   ⊢ Ⅎ𝑦𝐴    &   ⊢ Ⅎ𝑦𝐵    ⇒   ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
Theorem	br1cnvinxp 37113	Binary relation on the converse of an intersection with a Cartesian product. (Contributed by Peter Mazsa, 27-Jul-2019.)
⊢ (𝐶◡(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) ∧ 𝐷𝑅𝐶))
Theorem	releleccnv 37114	Elementhood in a converse 𝑅-coset when 𝑅 is a relation. (Contributed by Peter Mazsa, 9-Dec-2018.)
⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]◡𝑅 ↔ 𝐴𝑅𝐵))
Theorem	releccnveq 37115*	Equality of converse 𝑅-coset and converse 𝑆-coset when 𝑅 and 𝑆 are relations. (Contributed by Peter Mazsa, 27-Jul-2019.)
⊢ ((Rel 𝑅 ∧ Rel 𝑆) → ([𝐴]◡𝑅 = [𝐵]◡𝑆 ↔ ∀𝑥(𝑥𝑅𝐴 ↔ 𝑥𝑆𝐵)))
Theorem	opelvvdif 37116	Negated elementhood of ordered pair. (Contributed by Peter Mazsa, 14-Jan-2019.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))
Theorem	vvdifopab 37117*	Ordered-pair class abstraction defined by a negation. (Contributed by Peter Mazsa, 25-Jun-2019.)
⊢ ((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
Theorem	brvdif 37118	Binary relation with universal complement is the negation of the relation. (Contributed by Peter Mazsa, 1-Jul-2018.)
⊢ (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵)
Theorem	brvdif2 37119	Binary relation with universal complement. (Contributed by Peter Mazsa, 14-Jul-2018.)
⊢ (𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
Theorem	brvvdif 37120	Binary relation with the complement under the universal class of ordered pairs. (Contributed by Peter Mazsa, 9-Nov-2018.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴((V × V) ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵))
Theorem	brvbrvvdif 37121	Binary relation with the complement under the universal class of ordered pairs is the same as with universal complement. (Contributed by Peter Mazsa, 28-Nov-2018.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴((V × V) ∖ 𝑅)𝐵 ↔ 𝐴(V ∖ 𝑅)𝐵))
Theorem	brcnvep 37122	The converse of the binary epsilon relation. (Contributed by Peter Mazsa, 30-Jan-2018.)
⊢ (𝐴 ∈ 𝑉 → (𝐴◡ E 𝐵 ↔ 𝐵 ∈ 𝐴))
Theorem	elecALTV 37123	Elementhood in the 𝑅-coset of 𝐴. Theorem 72 of [Suppes] p. 82. (I think we should replace elecg 8743 with this original form of Suppes. Peter Mazsa). (Contributed by Mario Carneiro, 9-Jul-2014.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐵))
Theorem	brcnvepres 37124	Restricted converse epsilon binary relation. (Contributed by Peter Mazsa, 10-Feb-2018.)
⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵(◡ E ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)))
Theorem	brres2 37125	Binary relation on a restriction. (Contributed by Peter Mazsa, 2-Jan-2019.) (Revised by Peter Mazsa, 16-Dec-2021.)
⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ 𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶)
Theorem	br1cnvres 37126	Binary relation on the converse of a restriction. (Contributed by Peter Mazsa, 27-Jul-2019.)
⊢ (𝐵 ∈ 𝑉 → (𝐵◡(𝑅 ↾ 𝐴)𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝐶𝑅𝐵)))
Theorem	eldmres 37127*	Elementhood in the domain of a restriction. (Contributed by Peter Mazsa, 9-Jan-2019.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ dom (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ ∃𝑦 𝐵𝑅𝑦)))
Theorem	elrnres 37128*	Element of the range of a restriction. (Contributed by Peter Mazsa, 26-Dec-2018.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ ran (𝑅 ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑥𝑅𝐵))
Theorem	eldmressnALTV 37129	Element of the domain of a restriction to a singleton. (Contributed by Peter Mazsa, 12-Jun-2024.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ dom (𝑅 ↾ {𝐴}) ↔ (𝐵 = 𝐴 ∧ 𝐴 ∈ dom 𝑅)))
Theorem	elrnressn 37130	Element of the range of a restriction to a singleton. (Contributed by Peter Mazsa, 12-Jun-2024.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ ran (𝑅 ↾ {𝐴}) ↔ 𝐴𝑅𝐵))
Theorem	eldm4 37131*	Elementhood in a domain. (Contributed by Peter Mazsa, 24-Oct-2018.)
⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑦 𝑦 ∈ [𝐴]𝑅))
Theorem	eldmres2 37132*	Elementhood in the domain of a restriction. (Contributed by Peter Mazsa, 21-Aug-2020.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ dom (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ ∃𝑦 𝑦 ∈ [𝐵]𝑅)))
Theorem	eceq1i 37133	Equality theorem for 𝐶-coset of 𝐴 and 𝐶-coset of 𝐵, inference version. (Contributed by Peter Mazsa, 11-May-2021.)
⊢ 𝐴 = 𝐵    ⇒   ⊢ [𝐴]𝐶 = [𝐵]𝐶
Theorem	elecres 37134	Elementhood in the restricted coset of 𝐵. (Contributed by Peter Mazsa, 21-Sep-2018.)
⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ [𝐵](𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
Theorem	ecres 37135*	Restricted coset of 𝐵. (Contributed by Peter Mazsa, 9-Dec-2018.)
⊢ [𝐵](𝑅 ↾ 𝐴) = {𝑥 ∣ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝑥)}
Theorem	ecres2 37136	The restricted coset of 𝐵 when 𝐵 is an element of the restriction. (Contributed by Peter Mazsa, 16-Oct-2018.)
⊢ (𝐵 ∈ 𝐴 → [𝐵](𝑅 ↾ 𝐴) = [𝐵]𝑅)
Theorem	eccnvepres 37137*	Restricted converse epsilon coset of 𝐵. (Contributed by Peter Mazsa, 11-Feb-2018.) (Revised by Peter Mazsa, 21-Oct-2021.)
⊢ (𝐵 ∈ 𝑉 → [𝐵](◡ E ↾ 𝐴) = {𝑥 ∈ 𝐵 ∣ 𝐵 ∈ 𝐴})
Theorem	eleccnvep 37138	Elementhood in the converse epsilon coset of 𝐴 is elementhood in 𝐴. (Contributed by Peter Mazsa, 27-Jan-2019.)
⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ [𝐴]◡ E ↔ 𝐵 ∈ 𝐴))
Theorem	eccnvep 37139	The converse epsilon coset of a set is the set. (Contributed by Peter Mazsa, 27-Jan-2019.)
⊢ (𝐴 ∈ 𝑉 → [𝐴]◡ E = 𝐴)
Theorem	extep 37140	Property of epsilon relation, see also extid 37168, extssr 37368 and the comment of df-ssr 37357. (Contributed by Peter Mazsa, 10-Jul-2019.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ([𝐴]◡ E = [𝐵]◡ E ↔ 𝐴 = 𝐵))
Theorem	disjeccnvep 37141	Property of the epsilon relation. (Contributed by Peter Mazsa, 27-Apr-2020.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]◡ E ∩ [𝐵]◡ E ) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅))
Theorem	eccnvepres2 37142	The restricted converse epsilon coset of an element of the restriction is the element itself. (Contributed by Peter Mazsa, 16-Jul-2019.)
⊢ (𝐵 ∈ 𝐴 → [𝐵](◡ E ↾ 𝐴) = 𝐵)
Theorem	eccnvepres3 37143	Condition for a restricted converse epsilon coset of a set to be the set itself. (Contributed by Peter Mazsa, 11-May-2021.)
⊢ (𝐵 ∈ dom (◡ E ↾ 𝐴) → [𝐵](◡ E ↾ 𝐴) = 𝐵)
Theorem	eldmqsres 37144*	Elementhood in a restricted domain quotient set. (Contributed by Peter Mazsa, 21-Aug-2020.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ (dom (𝑅 ↾ 𝐴) / (𝑅 ↾ 𝐴)) ↔ ∃𝑢 ∈ 𝐴 (∃𝑥 𝑥 ∈ [𝑢]𝑅 ∧ 𝐵 = [𝑢]𝑅)))
Theorem	eldmqsres2 37145*	Elementhood in a restricted domain quotient set. (Contributed by Peter Mazsa, 22-Aug-2020.)
⊢ (𝐵 ∈ 𝑉 → (𝐵 ∈ (dom (𝑅 ↾ 𝐴) / (𝑅 ↾ 𝐴)) ↔ ∃𝑢 ∈ 𝐴 ∃𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑢]𝑅))
Theorem	qsss1 37146	Subclass theorem for quotient sets. (Contributed by Peter Mazsa, 12-Sep-2020.)
⊢ (𝐴 ⊆ 𝐵 → (𝐴 / 𝐶) ⊆ (𝐵 / 𝐶))
Theorem	qseq1i 37147	Equality theorem for quotient set, inference form. (Contributed by Peter Mazsa, 3-Jun-2021.)
⊢ 𝐴 = 𝐵    ⇒   ⊢ (𝐴 / 𝐶) = (𝐵 / 𝐶)
Theorem	qseq1d 37148	Equality theorem for quotient set, deduction form. (Contributed by Peter Mazsa, 27-May-2021.)
⊢ (𝜑 → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → (𝐴 / 𝐶) = (𝐵 / 𝐶))
Theorem	brinxprnres 37149	Binary relation on a restriction. (Contributed by Peter Mazsa, 2-Jan-2019.)
⊢ (𝐶 ∈ 𝑉 → (𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
Theorem	inxprnres 37150*	Restriction of a class as a class of ordered pairs. (Contributed by Peter Mazsa, 2-Jan-2019.)
⊢ (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
Theorem	dfres4 37151	Alternate definition of the restriction of a class. (Contributed by Peter Mazsa, 2-Jan-2019.)
⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))
Theorem	exan3 37152*	Equivalent expressions with existential quantification. (Contributed by Peter Mazsa, 10-Sep-2021.)
⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑢(𝐴 ∈ [𝑢]𝑅 ∧ 𝐵 ∈ [𝑢]𝑅) ↔ ∃𝑢(𝑢𝑅𝐴 ∧ 𝑢𝑅𝐵)))
Theorem	exanres 37153*	Equivalent expressions with existential quantification. (Contributed by Peter Mazsa, 2-May-2021.)
⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑢(𝑢(𝑅 ↾ 𝐴)𝐵 ∧ 𝑢(𝑆 ↾ 𝐴)𝐶) ↔ ∃𝑢 ∈ 𝐴 (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
Theorem	exanres3 37154*	Equivalent expressions with restricted existential quantification. (Contributed by Peter Mazsa, 10-Sep-2021.)
⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑢 ∈ 𝐴 (𝐵 ∈ [𝑢]𝑅 ∧ 𝐶 ∈ [𝑢]𝑆) ↔ ∃𝑢 ∈ 𝐴 (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
Theorem	exanres2 37155*	Equivalent expressions with existential quantification. (Contributed by Peter Mazsa, 10-Sep-2021.)
⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑢(𝑢(𝑅 ↾ 𝐴)𝐵 ∧ 𝑢(𝑆 ↾ 𝐴)𝐶) ↔ ∃𝑢 ∈ 𝐴 (𝐵 ∈ [𝑢]𝑅 ∧ 𝐶 ∈ [𝑢]𝑆)))
Theorem	cnvepres 37156*	Restricted converse epsilon relation as a class of ordered pairs. (Contributed by Peter Mazsa, 10-Feb-2018.)
⊢ (◡ E ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)}
Theorem	eqrel2 37157*	Equality of relations. (Contributed by Peter Mazsa, 8-Mar-2019.)
⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥∀𝑦(𝑥𝐴𝑦 ↔ 𝑥𝐵𝑦)))
Theorem	rncnv 37158	Range of converse is the domain. (Contributed by Peter Mazsa, 12-Feb-2018.)
⊢ ran ◡𝐴 = dom 𝐴
Theorem	dfdm6 37159*	Alternate definition of domain. (Contributed by Peter Mazsa, 2-Mar-2018.)
⊢ dom 𝑅 = {𝑥 ∣ [𝑥]𝑅 ≠ ∅}
Theorem	dfrn6 37160*	Alternate definition of range. (Contributed by Peter Mazsa, 1-Aug-2018.)
⊢ ran 𝑅 = {𝑥 ∣ [𝑥]◡𝑅 ≠ ∅}
Theorem	rncnvepres 37161	The range of the restricted converse epsilon is the union of the restriction. (Contributed by Peter Mazsa, 11-Feb-2018.) (Revised by Peter Mazsa, 26-Sep-2021.)
⊢ ran (◡ E ↾ 𝐴) = ∪ 𝐴
Theorem	dmecd 37162	Equality of the coset of 𝐵 and the coset of 𝐶 implies equivalence of domain elementhood (equivalence is not necessary as opposed to ereldm 8748). (Contributed by Peter Mazsa, 9-Oct-2018.)
⊢ (𝜑 → dom 𝑅 = 𝐴)    &   ⊢ (𝜑 → [𝐵]𝑅 = [𝐶]𝑅)    ⇒   ⊢ (𝜑 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
Theorem	dmec2d 37163	Equality of the coset of 𝐵 and the coset of 𝐶 implies equivalence of domain elementhood (equivalence is not necessary as opposed to ereldm 8748). (Contributed by Peter Mazsa, 12-Oct-2018.)
⊢ (𝜑 → [𝐵]𝑅 = [𝐶]𝑅)    ⇒   ⊢ (𝜑 → (𝐵 ∈ dom 𝑅 ↔ 𝐶 ∈ dom 𝑅))
Theorem	brid 37164	Property of the identity binary relation. (Contributed by Peter Mazsa, 18-Dec-2021.)
⊢ (𝐴 I 𝐵 ↔ 𝐵 I 𝐴)
Theorem	ideq2 37165	For sets, the identity binary relation is the same as equality. (Contributed by Peter Mazsa, 24-Jun-2020.) (Revised by Peter Mazsa, 18-Dec-2021.)
⊢ (𝐴 ∈ 𝑉 → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))
Theorem	idresssidinxp 37166	Condition for the identity restriction to be a subclass of identity intersection with a Cartesian product. (Contributed by Peter Mazsa, 19-Jul-2018.)
⊢ (𝐴 ⊆ 𝐵 → ( I ↾ 𝐴) ⊆ ( I ∩ (𝐴 × 𝐵)))
Theorem	idreseqidinxp 37167	Condition for the identity restriction to be equal to the identity intersection with a Cartesian product. (Contributed by Peter Mazsa, 19-Jul-2018.)
⊢ (𝐴 ⊆ 𝐵 → ( I ∩ (𝐴 × 𝐵)) = ( I ↾ 𝐴))
Theorem	extid 37168	Property of identity relation, see also extep 37140, extssr 37368 and the comment of df-ssr 37357. (Contributed by Peter Mazsa, 5-Jul-2019.)
⊢ (𝐴 ∈ 𝑉 → ([𝐴]◡ I = [𝐵]◡ I ↔ 𝐴 = 𝐵))
Theorem	inxpss 37169*	Two ways to say that an intersection with a Cartesian product is a subclass. (Contributed by Peter Mazsa, 16-Jul-2019.)
⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ 𝑆 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥𝑆𝑦))
Theorem	idinxpss 37170*	Two ways to say that an intersection of the identity relation with a Cartesian product is a subclass. (Contributed by Peter Mazsa, 16-Jul-2019.)
⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 → 𝑥𝑅𝑦))
Theorem	ref5 37171*	Two ways to say that an intersection of the identity relation with a Cartesian product is a subclass. (Contributed by Peter Mazsa, 12-Dec-2023.)
⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ 𝑅 ↔ ∀𝑥 ∈ (𝐴 ∩ 𝐵)𝑥𝑅𝑥)
Theorem	inxpss3 37172*	Two ways to say that an intersection with a Cartesian product is a subclass (see also inxpss 37169). (Contributed by Peter Mazsa, 8-Mar-2019.)
⊢ (∀𝑥∀𝑦(𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 → 𝑥(𝑆 ∩ (𝐴 × 𝐵))𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥𝑆𝑦))
Theorem	inxpss2 37173*	Two ways to say that intersections with Cartesian products are in a subclass relation. (Contributed by Peter Mazsa, 8-Mar-2019.)
⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑆 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥𝑆𝑦))
Theorem	inxpssidinxp 37174*	Two ways to say that intersections with Cartesian products are in a subclass relation, special case of inxpss2 37173. (Contributed by Peter Mazsa, 4-Jul-2019.)
⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⊆ ( I ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 → 𝑥 = 𝑦))
Theorem	idinxpssinxp 37175*	Two ways to say that intersections with Cartesian products are in a subclass relation, special case of inxpss2 37173. (Contributed by Peter Mazsa, 6-Mar-2019.)
⊢ (( I ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 → 𝑥𝑅𝑦))
Theorem	idinxpssinxp2 37176*	Identity intersection with a square Cartesian product in subclass relation with an intersection with the same Cartesian product. (Contributed by Peter Mazsa, 4-Mar-2019.) (Proof modification is discouraged.)
⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
Theorem	idinxpssinxp3 37177	Identity intersection with a square Cartesian product in subclass relation with an intersection with the same Cartesian product. (Contributed by Peter Mazsa, 16-Mar-2019.) (Proof modification is discouraged.)
⊢ (( I ∩ (𝐴 × 𝐴)) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ↔ ( I ↾ 𝐴) ⊆ 𝑅)
Theorem	idinxpssinxp4 37178*	Identity intersection with a square Cartesian product in subclass relation with an intersection with the same Cartesian product (see also idinxpssinxp2 37176). (Contributed by Peter Mazsa, 8-Mar-2019.)
⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 = 𝑦 → 𝑥𝑅𝑦) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
Theorem	relcnveq3 37179*	Two ways of saying a relation is symmetric. (Contributed by FL, 31-Aug-2009.)
⊢ (Rel 𝑅 → (𝑅 = ◡𝑅 ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑦𝑅𝑥)))
Theorem	relcnveq 37180	Two ways of saying a relation is symmetric. (Contributed by Peter Mazsa, 23-Aug-2018.)
⊢ (Rel 𝑅 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑅 = 𝑅))
Theorem	relcnveq2 37181*	Two ways of saying a relation is symmetric. (Contributed by Peter Mazsa, 28-Apr-2019.)
⊢ (Rel 𝑅 → (◡𝑅 = 𝑅 ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 ↔ 𝑦𝑅𝑥)))
Theorem	relcnveq4 37182*	Two ways of saying a relation is symmetric. (Contributed by Peter Mazsa, 28-Apr-2019.)
⊢ (Rel 𝑅 → (◡𝑅 ⊆ 𝑅 ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 ↔ 𝑦𝑅𝑥)))
Theorem	qsresid 37183	Simplification of a special quotient set. (Contributed by Peter Mazsa, 2-Sep-2020.)
⊢ (𝐴 / (𝑅 ↾ 𝐴)) = (𝐴 / 𝑅)
Theorem	n0elqs 37184	Two ways of expressing that the empty set is not an element of a quotient set. (Contributed by Peter Mazsa, 5-Dec-2019.)
⊢ (¬ ∅ ∈ (𝐴 / 𝑅) ↔ 𝐴 ⊆ dom 𝑅)
Theorem	n0elqs2 37185	Two ways of expressing that the empty set is not an element of a quotient set. (Contributed by Peter Mazsa, 25-Jul-2021.)
⊢ (¬ ∅ ∈ (𝐴 / 𝑅) ↔ dom (𝑅 ↾ 𝐴) = 𝐴)
Theorem	ecex2 37186	Condition for a coset to be a set. (Contributed by Peter Mazsa, 4-May-2019.)
⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → (𝐵 ∈ 𝐴 → [𝐵]𝑅 ∈ V))
Theorem	uniqsALTV 37187	The union of a quotient set, like uniqs 8768 but with a weaker antecedent: only the restricion of 𝑅 by 𝐴 needs to be a set, not 𝑅 itself, see e.g. cnvepima 37195. (Contributed by Peter Mazsa, 20-Jun-2019.)
⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴))
Theorem	imaexALTV 37188	Existence of an image of a class. Theorem 3.17 of [Monk1] p. 39. (cf. imaexg 7903) with weakened antecedent: only the restricion of 𝐴 by a set needs to be a set, not 𝐴 itself, see e.g. cnvepimaex 37194. (Contributed by Peter Mazsa, 22-Feb-2023.) (Proof modification is discouraged.)
⊢ ((𝐴 ∈ 𝑉 ∨ ((𝐴 ↾ 𝐵) ∈ 𝑊 ∧ 𝐵 ∈ 𝑋)) → (𝐴 “ 𝐵) ∈ V)
Theorem	ecexALTV 37189	Existence of a coset, like ecexg 8704 but with a weaker antecedent: only the restricion of 𝑅 by the singleton of 𝐴 needs to be a set, not 𝑅 itself, see e.g. eccnvepex 37193. (Contributed by Peter Mazsa, 22-Feb-2023.)
⊢ ((𝑅 ↾ {𝐴}) ∈ 𝑉 → [𝐴]𝑅 ∈ V)
Theorem	rnresequniqs 37190	The range of a restriction is equal to the union of the quotient set. (Contributed by Peter Mazsa, 19-May-2018.)
⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ran (𝑅 ↾ 𝐴) = ∪ (𝐴 / 𝑅))
Theorem	n0el2 37191	Two ways of expressing that the empty set is not an element of a class. (Contributed by Peter Mazsa, 31-Jan-2018.)
⊢ (¬ ∅ ∈ 𝐴 ↔ dom (◡ E ↾ 𝐴) = 𝐴)
Theorem	cnvepresex 37192	Sethood condition for the restricted converse epsilon relation. (Contributed by Peter Mazsa, 24-Sep-2018.)
⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V)
Theorem	eccnvepex 37193	The converse epsilon coset exists. (Contributed by Peter Mazsa, 22-Mar-2023.)
⊢ [𝐴]◡ E ∈ V
Theorem	cnvepimaex 37194	The image of converse epsilon exists, proof via imaexALTV 37188 (see also cnvepima 37195 and uniexg 7727 for alternate way). (Contributed by Peter Mazsa, 22-Mar-2023.)
⊢ (𝐴 ∈ 𝑉 → (◡ E “ 𝐴) ∈ V)
Theorem	cnvepima 37195	The image of converse epsilon. (Contributed by Peter Mazsa, 22-Mar-2023.)
⊢ (𝐴 ∈ 𝑉 → (◡ E “ 𝐴) = ∪ 𝐴)
Theorem	inex3 37196	Sufficient condition for the intersection relation to be a set. (Contributed by Peter Mazsa, 24-Nov-2019.)
⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 ∩ 𝐵) ∈ V)
Theorem	inxpex 37197	Sufficient condition for an intersection with a Cartesian product to be a set. (Contributed by Peter Mazsa, 10-May-2019.)
⊢ ((𝑅 ∈ 𝑊 ∨ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (𝑅 ∩ (𝐴 × 𝐵)) ∈ V)
Theorem	eqres 37198	Converting a class constant definition by restriction (like df-ers 37522 or df-parts 37624) into a binary relation. (Contributed by Peter Mazsa, 1-Oct-2018.)
⊢ 𝑅 = (𝑆 ↾ 𝐶)    ⇒   ⊢ (𝐵 ∈ 𝑉 → (𝐴𝑅𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵)))
Theorem	brrabga 37199*	The law of concretion for operation class abstraction. (Contributed by Peter Mazsa, 24-Oct-2022.)
⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))    &   ⊢ 𝑅 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}    ⇒   ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨𝐴, 𝐵⟩𝑅𝐶 ↔ 𝜓))
Theorem	brcnvrabga 37200*	The law of concretion for the converse of operation class abstraction. (Contributed by Peter Mazsa, 25-Oct-2022.)
⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))    &   ⊢ 𝑅 = ◡{⟨⟨𝑦, 𝑧⟩, 𝑥⟩ ∣ 𝜑}    ⇒   ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝐴𝑅⟨𝐵, 𝐶⟩ ↔ 𝜓))