HomeHome Metamath Proof Explorer
Theorem List (p. 342 of 429)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-27903)
  Hilbert Space Explorer  Hilbert Space Explorer
(27904-29428)
  Users' Mathboxes  Users' Mathboxes
(29429-42879)
 

Theorem List for Metamath Proof Explorer - 34101-34200   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmpt2bi123f 34101* Equality deduction for maps-to notations with two arguments. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
𝑥𝐴    &   𝑥𝐵    &   𝑦𝐴    &   𝑦𝐵    &   𝑦𝐶    &   𝑦𝐷    &   𝑥𝐶    &   𝑥𝐷       (((𝐴 = 𝐵𝐶 = 𝐷) ∧ ∀𝑥𝐴𝑦𝐶 𝐸 = 𝐹) → (𝑥𝐴, 𝑦𝐶𝐸) = (𝑥𝐵, 𝑦𝐷𝐹))
 
Theoremiuneq12f 34102 Equality deduction for indexed unions. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
𝑥𝐴    &   𝑥𝐵       ((𝐴 = 𝐵 ∧ ∀𝑥𝐴 𝐶 = 𝐷) → 𝑥𝐴 𝐶 = 𝑥𝐵 𝐷)
 
Theoremiineq12f 34103 Equality deduction for indexed intersections. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
𝑥𝐴    &   𝑥𝐵       ((𝐴 = 𝐵 ∧ ∀𝑥𝐴 𝐶 = 𝐷) → 𝑥𝐴 𝐶 = 𝑥𝐵 𝐷)
 
Theoremopabbi 34104 Equality deduction for class abstraction of ordered pairs. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
(∀𝑥𝑦(𝜑𝜓) → {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
 
Theoremmptbi12f 34105 Equality deduction for maps-to notations. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
𝑥𝐴    &   𝑥𝐵       ((𝐴 = 𝐵 ∧ ∀𝑥𝐴 𝐷 = 𝐸) → (𝑥𝐴𝐷) = (𝑥𝐵𝐸))
 
20.20.4  Miscellanea

Work in progress or things that do not belong anywhere else.

 
Theoremscottexf 34106* A version of scottex 8786 with non-free variables instead of distinct variables. (Contributed by Giovanni Mascellani, 19-Aug-2018.)
𝑦𝐴    &   𝑥𝐴       {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ∈ V
 
Theoremscott0f 34107* A version of scott0 8787 with non-free variables instead of distinct variables. (Contributed by Giovanni Mascellani, 19-Aug-2018.)
𝑦𝐴    &   𝑥𝐴       (𝐴 = ∅ ↔ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} = ∅)
 
Theoremscottn0f 34108* A version of scott0f 34107 with inequalities instead of equalities. (Contributed by Giovanni Mascellani, 19-Aug-2018.)
𝑦𝐴    &   𝑥𝐴       (𝐴 ≠ ∅ ↔ {𝑥𝐴 ∣ ∀𝑦𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} ≠ ∅)
 
Theoremac6s3f 34109* Generalization of the Axiom of Choice to classes, with bound-variable hypothesis. (Contributed by Giovanni Mascellani, 19-Aug-2018.)
𝑦𝜓    &   𝐴 ∈ V    &   (𝑦 = (𝑓𝑥) → (𝜑𝜓))       (∀𝑥𝐴𝑦𝜑 → ∃𝑓𝑥𝐴 𝜓)
 
Theoremac6s6 34110* Generalization of the Axiom of Choice to classes, moving the existence condition in the consequent. (Contributed by Giovanni Mascellani, 19-Aug-2018.)
𝑦𝜓    &   𝐴 ∈ V    &   (𝑦 = (𝑓𝑥) → (𝜑𝜓))       𝑓𝑥𝐴 (∃𝑦𝜑𝜓)
 
Theoremac6s6f 34111* Generalization of the Axiom of Choice to classes, moving the existence condition in the consequent. (Contributed by Giovanni Mascellani, 20-Aug-2018.)
𝐴 ∈ V    &   𝑦𝜓    &   (𝑦 = (𝑓𝑥) → (𝜑𝜓))    &   𝑥𝐴       𝑓𝑥𝐴 (∃𝑦𝜑𝜓)
 
20.21  Mathbox for Peter Mazsa
 
20.21.1  Notations
 
Syntaxcxrn 34112 Extend the definition of a class to include the range Cartesian product class.
class (𝐴𝐵)
 
Syntaxccoss 34113 Extend the definition of a class to include the class of cosets by a class. (Read: the class of cosets by 𝑅.)
class 𝑅
 
Syntaxccoels 34114 Extend the definition of a class to include the class of coelements on a class. (Read: the class of coelements on 𝐴.)
class 𝐴
 
Syntaxcrels 34115 Extend the definition of a class to include the relation class.
class Rels
 
Syntaxcssr 34116 Extend the definition of a class to include the subset class.
class S
 
Syntaxcrefs 34117 Extend the definition of a class to include the reflexivity class.
class Refs
 
Syntaxcrefrels 34118 Extend the definition of a class to include the reflexive relations class.
class RefRels
 
Syntaxwrefrel 34119 Extend the definition of a wff to include the reflexive relation predicate. (Read: 𝑅 is a reflexive relation.)
wff RefRel 𝑅
 
Syntaxccnvrefs 34120 Extend the definition of a class to include the converse reflexivity class.
class CnvRefs
 
Syntaxccnvrefrels 34121 Extend the definition of a class to include the converse reflexive relations class.
class CnvRefRels
 
Syntaxwcnvrefrel 34122 Extend the definition of a wff to include the converse reflexive relation predicate. (Read: 𝑅 is a converse reflexive relation.)
wff CnvRefRel 𝑅
 
Syntaxcsyms 34123 Extend the definition of a class to include the symmetry class.
class Syms
 
Syntaxcsymrels 34124 Extend the definition of a class to include the symmetry relations class.
class SymRels
 
Syntaxwsymrel 34125 Extend the definition of a wff to include the symmetry relation predicate. (Read: 𝑅 is a symmetric relation.)
wff SymRel 𝑅
 
20.21.2  Preparatory theorems
 
Theoremelv 34126 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. Inference forms (with 𝐴 ∈ V hypotheses) of the general theorems (proving (𝐴𝑉 assertions) may be superfluous. (Contributed by Peter Mazsa, 13-Oct-2018.)
(𝑥 ∈ V → 𝜑)       𝜑
 
Theoremel2v 34127 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. Inference forms (with 𝐴 ∈ V and 𝐵 ∈ V hypotheses) of the general theorems (proving ((𝐴𝑉𝐵𝑊) → assertions) may be superfluous. (Contributed by Peter Mazsa, 13-Oct-2018.)
((𝑥 ∈ V ∧ 𝑦 ∈ V) → 𝜑)       𝜑
 
Theoremel2v1 34128 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 23-Oct-2018.)
((𝑥 ∈ V ∧ 𝜑) → 𝜓)       (𝜑𝜓)
 
Theoremel2v2 34129 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 23-Oct-2018.)
((𝜑𝑦 ∈ V) → 𝜓)       (𝜑𝜓)
 
Theoremel3v 34130 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. Inference forms (with 𝐴 ∈ V, 𝐵 ∈ V and 𝐶 ∈ V hypotheses) of the general theorems (proving ((𝐴𝑉𝐵𝑊𝐶𝑋) → assertions) may be superfluous. (Contributed by Peter Mazsa, 13-Oct-2018.)
((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → 𝜑)       𝜑
 
Theoremel3v1 34131 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 16-Oct-2020.)
((𝑥 ∈ V ∧ 𝜓𝜒) → 𝜃)       ((𝜓𝜒) → 𝜃)
 
Theoremel3v2 34132 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 16-Oct-2020.)
((𝜑𝑦 ∈ V ∧ 𝜒) → 𝜃)       ((𝜑𝜒) → 𝜃)
 
Theoremel3v3 34133 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 16-Oct-2020.)
((𝜑𝜓𝑧 ∈ V) → 𝜃)       ((𝜑𝜓) → 𝜃)
 
Theoremel3v12 34134 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 11-Jul-2021.)
((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝜒) → 𝜃)       (𝜒𝜃)
 
Theoremel3v13 34135 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 11-Jul-2021.)
((𝑥 ∈ V ∧ 𝜓𝑧 ∈ V) → 𝜃)       (𝜓𝜃)
 
Theoremel3v23 34136 New way (elv 34126, and the theorems beginning with "el2v" or "el3v") to shorten some proofs. (Contributed by Peter Mazsa, 11-Jul-2021.)
((𝜑𝑦 ∈ V ∧ 𝑧 ∈ V) → 𝜃)       (𝜑𝜃)
 
Theorembiancom 34137 Commuting conjunction in a biconditional. (Contributed by Peter Mazsa, 17-Jun-2018.)
(𝜑 ↔ (𝜒𝜓))       (𝜑 ↔ (𝜓𝜒))
 
Theorembiancomd 34138 Commuting conjunction in a biconditional, deduction form. (Contributed by Peter Mazsa, 3-Oct-2018.)
(𝜑 → (𝜓 ↔ (𝜃𝜒)))       (𝜑 → (𝜓 ↔ (𝜒𝜃)))
 
Theoremanbi1ci 34139 Introduce a left and the same right conjunct to the sides of a logical equivalence. (Contributed by Peter Mazsa, 7-Mar-2020.)
(𝜑𝜓)       ((𝜒𝜑) ↔ (𝜓𝜒))
 
Theoremanbi1cd 34140 Introduce a left and the same right conjunct to the sides of a logical equivalence, deduction form. (Contributed by Peter Mazsa, 22-May-2021.)
(𝜑 → (𝜓𝜒))       (𝜑 → ((𝜃𝜓) ↔ (𝜒𝜃)))
 
Theoreman2anr 34141 Double commutation in conjunction. (Contributed by Peter Mazsa, 27-Jun-2019.)
(((𝜑𝜓) ∧ (𝜒𝜃)) ↔ ((𝜓𝜑) ∧ (𝜃𝜒)))
 
Theoremanan 34142 Multiple commutations in conjunction. (Contributed by Peter Mazsa, 7-Mar-2020.)
((((𝜑𝜓) ∧ 𝜒) ∧ ((𝜑𝜃) ∧ 𝜏)) ↔ ((𝜓𝜃) ∧ (𝜑 ∧ (𝜒𝜏))))
 
Theoremtriantru3 34143 A wff is equivalent to its conjunctions with truths. (Contributed by Peter Mazsa, 30-Nov-2018.)
𝜑    &   𝜓       (𝜒 ↔ (𝜑𝜓𝜒))
 
Theoremeqeltr 34144 Substitution of equal classes into elementhood relation. (Contributed by Peter Mazsa, 22-Jul-2017.)
((𝐴 = 𝐵𝐵𝐶) → 𝐴𝐶)
 
Theoremeqelb 34145 Substitution of equal classes into elementhood relation. (Contributed by Peter Mazsa, 17-Jul-2019.)
((𝐴 = 𝐵𝐴𝐶) ↔ (𝐴 = 𝐵𝐵𝐶))
 
Theoremeqeqan1d 34146 Implication of introducing a new equality. (Contributed by Peter Mazsa, 17-Apr-2019.)
(𝜑𝐴 = 𝐵)       ((𝜑𝐶 = 𝐷) → (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremeqeqan2d 34147 Implication of introducing a new equality. (Contributed by Peter Mazsa, 17-Apr-2019.)
(𝜑𝐶 = 𝐷)       ((𝐴 = 𝐵𝜑) → (𝐴 = 𝐶𝐵 = 𝐷))
 
Theoremineqcom 34148 Two ways of saying that two classes are disjoint (when 𝐶 = ∅: ((𝐴𝐵) = ∅ ↔ (𝐵𝐴) = ∅)). (Contributed by Peter Mazsa, 22-Mar-2017.)
((𝐴𝐵) = 𝐶 ↔ (𝐵𝐴) = 𝐶)
 
Theoremineqcomi 34149 Disjointness inference (when 𝐶 = ∅), inference form of ineqcom 34148. (Contributed by Peter Mazsa, 26-Mar-2017.)
(𝐴𝐵) = 𝐶       (𝐵𝐴) = 𝐶
 
Theoreminres2 34150 Two ways of expressing the restriction of an intersection. (Contributed by Peter Mazsa, 5-Jun-2021.)
((𝑅𝐴) ∩ 𝑆) = ((𝑅𝑆) ↾ 𝐴)
 
Theoremcoideq 34151 Equality theorem for composition of two classes. (Contributed by Peter Mazsa, 23-Sep-2021.)
(𝐴 = 𝐵 → (𝐴𝐴) = (𝐵𝐵))
 
Theoremralanid 34152 Cancellation law for restriction. (Contributed by Peter Mazsa, 30-Dec-2018.)
(∀𝑥𝐴 (𝑥𝐴𝜑) ↔ ∀𝑥𝐴 𝜑)
 
Theoremnexmo 34153 If there is no case where wff is true, it is true for at most one case. (Contributed by Peter Mazsa, 27-Sep-2021.)
(¬ ∃𝑥𝜑 → ∃*𝑥𝜑)
 
Theorem3albii 34154 Inference adding three universal quantifiers to both sides of an equivalence. (Contributed by Peter Mazsa, 10-Aug-2018.)
(𝜑𝜓)       (∀𝑥𝑦𝑧𝜑 ↔ ∀𝑥𝑦𝑧𝜓)
 
Theorem3ralbii 34155 Inference adding three restricted universal quantifiers to both sides of an equivalence. (Contributed by Peter Mazsa, 25-Jul-2019.)
(𝜑𝜓)       (∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜑 ↔ ∀𝑥𝐴𝑦𝐵𝑧𝐶 𝜓)
 
Theoremrabbieq 34156 Equivalent wff's correspond to restricted class abstractions which are equal with the same class. (Contributed by Peter Mazsa, 8-Jul-2019.)
𝐵 = {𝑥𝐴𝜑}    &   (𝜑𝜓)       𝐵 = {𝑥𝐴𝜓}
 
Theoremrabimbieq 34157 Restricted equivalent wff's correspond to restricted class abstractions which are equal with the same class. (Contributed by Peter Mazsa, 22-Jul-2021.)
𝐵 = {𝑥𝐴𝜑}    &   (𝑥𝐴 → (𝜑𝜓))       𝐵 = {𝑥𝐴𝜓}
 
Theoremabeqin 34158* Intersection with class abstraction. (Contributed by Peter Mazsa, 21-Jul-2021.)
𝐴 = (𝐵𝐶)    &   𝐵 = {𝑥𝜑}       𝐴 = {𝑥𝐶𝜑}
 
Theoremabeqinbi 34159* Intersection with class abstraction and equivalent wff's. (Contributed by Peter Mazsa, 21-Jul-2021.)
𝐴 = (𝐵𝐶)    &   𝐵 = {𝑥𝜑}    &   (𝑥𝐶 → (𝜑𝜓))       𝐴 = {𝑥𝐶𝜓}
 
Theoremrabeqel 34160* Class element of a restricted class abstraction. (Contributed by Peter Mazsa, 24-Jul-2021.)
𝐵 = {𝑥𝐴𝜑}    &   (𝑥 = 𝐶 → (𝜑𝜓))       (𝐶𝐵 ↔ (𝜓𝐶𝐴))
 
Theoremeqrelf 34161* The equality connective between relations. (Contributed by Peter Mazsa, 25-Jun-2019.)
𝑥𝐴    &   𝑥𝐵    &   𝑦𝐴    &   𝑦𝐵       ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
 
Theoremreleleccnv 34162 Elementhood in a converse 𝑅-coset when 𝑅 is a relation. (Contributed by Peter Mazsa, 9-Dec-2018.)
(Rel 𝑅 → (𝐴 ∈ [𝐵]𝑅𝐴𝑅𝐵))
 
Theoremreleccnveq 34163* Equality of converse 𝑅-coset and converse 𝑆-coset when 𝑅 and 𝑆 are relations. (Contributed by Peter Mazsa, 27-Jul-2019.)
((Rel 𝑅 ∧ Rel 𝑆) → ([𝐴]𝑅 = [𝐵]𝑆 ↔ ∀𝑥(𝑥𝑅𝐴𝑥𝑆𝐵)))
 
Theoremopelvvdif 34164 Negated elementhood of ordered pair. (Contributed by Peter Mazsa, 14-Jan-2019.)
((𝐴𝑉𝐵𝑊) → (⟨𝐴, 𝐵⟩ ∈ ((V × V) ∖ 𝑅) ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅))
 
Theoremvvdifopab 34165* Ordered-pair class abstraction defined by a negation. (Contributed by Peter Mazsa, 25-Jun-2019.)
((V × V) ∖ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝜑}
 
Theorembrvdif 34166 Binary relation with universal complement is the negation of the relation. (Contributed by Peter Mazsa, 1-Jul-2018.)
(𝐴(V ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵)
 
Theorembrvdif2 34167 Binary relation with universal complement. (Contributed by Peter Mazsa, 14-Jul-2018.)
(𝐴(V ∖ 𝑅)𝐵 ↔ ¬ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
 
Theorembrvvdif 34168 Binary relation with the complement under the universal class of ordered pairs. (Contributed by Peter Mazsa, 9-Nov-2018.)
((𝐴𝑉𝐵𝑊) → (𝐴((V × V) ∖ 𝑅)𝐵 ↔ ¬ 𝐴𝑅𝐵))
 
Theorembrvbrvvdif 34169 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 ∖ 𝑅)𝐵))
 
Theorembrcnvep 34170 The converse of the binary epsilon relation. (Contributed by Peter Mazsa, 30-Jan-2018.)
(𝐴𝑉 → (𝐴 E 𝐵𝐵𝐴))
 
TheoremelecALTV 34171 Elementhood in the 𝑅-coset of 𝐴. Theorem 72 of [Suppes] p. 82. (I think we should replace elecg 7828 with this original form of Suppes. Peter Mazsa) (Contributed by Mario Carneiro, 9-Jul-2014.)
((𝐴𝑉𝐵𝑊) → (𝐵 ∈ [𝐴]𝑅𝐴𝑅𝐵))
 
TheoremopelresALTV 34172 Ordered pair elementhood in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.)
(𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
 
TheorembrresALTV 34173 Binary relation on a restriction. (Contributed by Mario Carneiro, 4-Nov-2015.)
(𝐶𝑉 → (𝐵(𝑅𝐴)𝐶 ↔ (𝐵𝐴𝐵𝑅𝐶)))
 
Theorembrcnvepres 34174 Restricted converse epsilon binary relation. (Contributed by Peter Mazsa, 10-Feb-2018.)
((𝐵𝑉𝐶𝑊) → (𝐵( E ↾ 𝐴)𝐶 ↔ (𝐵𝐴𝐶𝐵)))
 
Theorembrinxp2ALTV 34175 Intersection with cross product binary relation . (Contributed by NM, 3-Mar-2007.) (Revised by Mario Carneiro, 26-Apr-2015.)
(𝐶(𝑅 ∩ (𝐴 × 𝐵))𝐷 ↔ ((𝐶𝐴𝐷𝐵) ∧ 𝐶𝑅𝐷))
 
Theorembrres2 34176 Binary relation on a restriction. (Contributed by Peter Mazsa, 2-Jan-2019.) (Revised by Peter Mazsa, 16-Dec-2021.)
(𝐵(𝑅𝐴)𝐶𝐵(𝑅 ∩ (𝐴 × ran (𝑅𝐴)))𝐶)
 
Theoremeldmres 34177* Elementhood in the domain of a restriction. (Contributed by Peter Mazsa, 9-Jan-2019.)
(𝐵𝑉 → (𝐵 ∈ dom (𝑅𝐴) ↔ (𝐵𝐴 ∧ ∃𝑦 𝐵𝑅𝑦)))
 
Theoremeldm4 34178* Elementhood in a domain. (Contributed by Peter Mazsa, 24-Oct-2018.)
(𝐴𝑉 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑦 𝑦 ∈ [𝐴]𝑅))
 
Theoremeldmres2 34179* Elementhood in the domain of a restriction. (Contributed by Peter Mazsa, 21-Aug-2020.)
(𝐵𝑉 → (𝐵 ∈ dom (𝑅𝐴) ↔ (𝐵𝐴 ∧ ∃𝑦 𝑦 ∈ [𝐵]𝑅)))
 
Theoremeceq1i 34180 Equality theorem for 𝐶-coset of 𝐴 and 𝐶-coset of 𝐵, inference version. (Contributed by Peter Mazsa, 11-May-2021.)
𝐴 = 𝐵       [𝐴]𝐶 = [𝐵]𝐶
 
Theoremeceq2i 34181 Equality theorem for the 𝐴-coset and 𝐵-coset of 𝐶, inference version. (Contributed by Peter Mazsa, 11-May-2021.)
𝐴 = 𝐵       [𝐶]𝐴 = [𝐶]𝐵
 
Theoremeceq2d 34182 Equality theorem for the 𝐴-coset and 𝐵-coset of 𝐶, deduction version. (Contributed by Peter Mazsa, 23-Apr-2021.)
(𝜑𝐴 = 𝐵)       (𝜑 → [𝐶]𝐴 = [𝐶]𝐵)
 
Theoremelecres 34183 Elementhood in the restricted coset of 𝐵. (Contributed by Peter Mazsa, 21-Sep-2018.)
(𝐶𝑉 → (𝐶 ∈ [𝐵](𝑅𝐴) ↔ (𝐵𝐴𝐵𝑅𝐶)))
 
Theoremecres 34184* Restricted coset of 𝐵. (Contributed by Peter Mazsa, 9-Dec-2018.)
[𝐵](𝑅𝐴) = {𝑥 ∣ (𝐵𝐴𝐵𝑅𝑥)}
 
Theoremecres2 34185 The restricted coset of 𝐵 when 𝐵 is an element of the restriction. (Contributed by Peter Mazsa, 16-Oct-2018.)
(𝐵𝐴 → [𝐵](𝑅𝐴) = [𝐵]𝑅)
 
Theoremeccnvepres 34186* Restricted converse epsilon coset of 𝐵. (Contributed by Peter Mazsa, 11-Feb-2018.) (Revised by Peter Mazsa, 21-Oct-2021.)
(𝐵𝑉 → [𝐵]( E ↾ 𝐴) = {𝑥𝐵𝐵𝐴})
 
Theoremeleccnvep 34187 Elementhood in the converse epsilon coset of 𝐴 is elementhood in 𝐴. (Contributed by Peter Mazsa, 27-Jan-2019.)
(𝐴𝑉 → (𝐵 ∈ [𝐴] E ↔ 𝐵𝐴))
 
Theoremeccnvep 34188 The converse epsilon coset of a set is the set. (Contributed by Peter Mazsa, 27-Jan-2019.)
(𝐴𝑉 → [𝐴] E = 𝐴)
 
Theoremextep 34189 Property of epsilon relation, cf. extid 34222, extssr 34399 and the comment of df-ssr 34388. (Contributed by Peter Mazsa, 10-Jul-2019.)
((𝐴𝑉𝐵𝑊) → ([𝐴] E = [𝐵] E ↔ 𝐴 = 𝐵))
 
Theoremeccnvepres2 34190 The restricted converse epsilon coset of an element of the restriction is the element itself. (Contributed by Peter Mazsa, 16-Jul-2019.)
(𝐵𝐴 → [𝐵]( E ↾ 𝐴) = 𝐵)
 
Theoremeccnvepres3 34191 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 ↾ 𝐴) = 𝐵)
 
Theoremeldmqsres 34192* Elementhood in a restricted domain quotient set. (Contributed by Peter Mazsa, 21-Aug-2020.)
(𝐵𝑉 → (𝐵 ∈ (dom (𝑅𝐴) / (𝑅𝐴)) ↔ ∃𝑢𝐴 (∃𝑥 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑢]𝑅)))
 
Theoremeldmqsres2 34193* Elementhood in a restricted domain quotient set. (Contributed by Peter Mazsa, 22-Aug-2020.)
(𝐵𝑉 → (𝐵 ∈ (dom (𝑅𝐴) / (𝑅𝐴)) ↔ ∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑢]𝑅))
 
Theoremqsss1 34194 Subclass theorem for quotient sets. (Contributed by Peter Mazsa, 12-Sep-2020.)
(𝐴𝐵 → (𝐴 / 𝐶) ⊆ (𝐵 / 𝐶))
 
Theoremqseq1i 34195 Equality theorem for quotient set, inference form. (Contributed by Peter Mazsa, 3-Jun-2021.)
𝐴 = 𝐵       (𝐴 / 𝐶) = (𝐵 / 𝐶)
 
Theoremqseq1d 34196 Equality theorem for quotient set, deduction form. (Contributed by Peter Mazsa, 27-May-2021.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐴 / 𝐶) = (𝐵 / 𝐶))
 
Theoremqseq2i 34197 Equality theorem for quotient set, inference form. (Contributed by Peter Mazsa, 3-Jun-2021.)
𝐴 = 𝐵       (𝐶 / 𝐴) = (𝐶 / 𝐵)
 
Theoremqseq2d 34198 Equality theorem for quotient set, deduction form. (Contributed by Peter Mazsa, 27-May-2021.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐶 / 𝐴) = (𝐶 / 𝐵))
 
Theoremqseq12 34199 Equality theorem for quotient set. (Contributed by Peter Mazsa, 17-Apr-2019.)
((𝐴 = 𝐵𝐶 = 𝐷) → (𝐴 / 𝐶) = (𝐵 / 𝐷))
 
Theorembrinxprnres 34200 Binary relation on a restriction. (Contributed by Peter Mazsa, 2-Jan-2019.)
(𝐶𝑉 → (𝐵(𝑅 ∩ (𝐴 × ran (𝑅𝐴)))𝐶 ↔ (𝐵𝐴𝐵𝑅𝐶)))
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
  Copyright terms: Public domain < Previous  Next >