HomeHome Intuitionistic Logic Explorer
Theorem List (p. 65 of 134)
< Previous  Next >
Bad symbols? Try the
GIF version.

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

Theorem List for Intuitionistic Logic Explorer - 6401-6500   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremfnsnsplitdc 6401* Split a function into a single point and all the rest. (Contributed by Stefan O'Rear, 27-Feb-2015.) (Revised by Jim Kingdon, 29-Jan-2023.)
((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → 𝐹 = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
 
Theoremfunresdfunsndc 6402* Restricting a function to a domain without one element of the domain of the function, and adding a pair of this element and the function value of the element results in the function itself, where equality is decidable. (Contributed by AV, 2-Dec-2018.) (Revised by Jim Kingdon, 30-Jan-2023.)
((∀𝑥 ∈ dom 𝐹𝑦 ∈ dom 𝐹DECID 𝑥 = 𝑦 ∧ Fun 𝐹𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}) = 𝐹)
 
Theoremnndifsnid 6403 If we remove a single element from a natural number then put it back in, we end up with the original natural number. This strengthens difsnss 3666 from subset to equality but the proof relies on equality being decidable. (Contributed by Jim Kingdon, 31-Aug-2021.)
((𝐴 ∈ ω ∧ 𝐵𝐴) → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)
 
Theoremnnaordi 6404 Ordering property of addition. Proposition 8.4 of [TakeutiZaring] p. 58, limited to natural numbers. (Contributed by NM, 3-Feb-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
 
Theoremnnaord 6405 Ordering property of addition. Proposition 8.4 of [TakeutiZaring] p. 58, limited to natural numbers, and its converse. (Contributed by NM, 7-Mar-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
 
Theoremnnaordr 6406 Ordering property of addition of natural numbers. (Contributed by NM, 9-Nov-2002.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐴 +o 𝐶) ∈ (𝐵 +o 𝐶)))
 
Theoremnnaword 6407 Weak ordering property of addition. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
 
Theoremnnacan 6408 Cancellation law for addition of natural numbers. (Contributed by NM, 27-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴 +o 𝐵) = (𝐴 +o 𝐶) ↔ 𝐵 = 𝐶))
 
Theoremnnaword1 6409 Weak ordering property of addition. (Contributed by NM, 9-Nov-2002.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝐵))
 
Theoremnnaword2 6410 Weak ordering property of addition. (Contributed by NM, 9-Nov-2002.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ⊆ (𝐵 +o 𝐴))
 
Theoremnnawordi 6411 Adding to both sides of an inequality in ω (Contributed by Scott Fenton, 16-Apr-2012.) (Revised by Mario Carneiro, 12-May-2012.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 → (𝐴 +o 𝐶) ⊆ (𝐵 +o 𝐶)))
 
Theoremnnmordi 6412 Ordering property of multiplication. Half of Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers. (Contributed by NM, 18-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
(((𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 → (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
 
Theoremnnmord 6413 Ordering property of multiplication. Proposition 8.19 of [TakeutiZaring] p. 63, limited to natural numbers. (Contributed by NM, 22-Jan-1996.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → ((𝐴𝐵 ∧ ∅ ∈ 𝐶) ↔ (𝐶 ·o 𝐴) ∈ (𝐶 ·o 𝐵)))
 
Theoremnnmword 6414 Weak ordering property of ordinal multiplication. (Contributed by Mario Carneiro, 17-Nov-2014.)
(((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐶) → (𝐴𝐵 ↔ (𝐶 ·o 𝐴) ⊆ (𝐶 ·o 𝐵)))
 
Theoremnnmcan 6415 Cancellation law for multiplication of natural numbers. (Contributed by NM, 26-Oct-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
(((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))
 
Theorem1onn 6416 One is a natural number. (Contributed by NM, 29-Oct-1995.)
1o ∈ ω
 
Theorem2onn 6417 The ordinal 2 is a natural number. (Contributed by NM, 28-Sep-2004.)
2o ∈ ω
 
Theorem3onn 6418 The ordinal 3 is a natural number. (Contributed by Mario Carneiro, 5-Jan-2016.)
3o ∈ ω
 
Theorem4onn 6419 The ordinal 4 is a natural number. (Contributed by Mario Carneiro, 5-Jan-2016.)
4o ∈ ω
 
Theoremnnm1 6420 Multiply an element of ω by 1o. (Contributed by Mario Carneiro, 17-Nov-2014.)
(𝐴 ∈ ω → (𝐴 ·o 1o) = 𝐴)
 
Theoremnnm2 6421 Multiply an element of ω by 2o (Contributed by Scott Fenton, 18-Apr-2012.) (Revised by Mario Carneiro, 17-Nov-2014.)
(𝐴 ∈ ω → (𝐴 ·o 2o) = (𝐴 +o 𝐴))
 
Theoremnn2m 6422 Multiply an element of ω by 2o (Contributed by Scott Fenton, 16-Apr-2012.) (Revised by Mario Carneiro, 17-Nov-2014.)
(𝐴 ∈ ω → (2o ·o 𝐴) = (𝐴 +o 𝐴))
 
Theoremnnaordex 6423* Equivalence for ordering. Compare Exercise 23 of [Enderton] p. 88. (Contributed by NM, 5-Dec-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
 
Theoremnnawordex 6424* Equivalence for weak ordering of natural numbers. (Contributed by NM, 8-Nov-2002.) (Revised by Mario Carneiro, 15-Nov-2014.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
 
Theoremnnm00 6425 The product of two natural numbers is zero iff at least one of them is zero. (Contributed by Jim Kingdon, 11-Nov-2004.)
((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ·o 𝐵) = ∅ ↔ (𝐴 = ∅ ∨ 𝐵 = ∅)))
 
2.6.24  Equivalence relations and classes
 
Syntaxwer 6426 Extend the definition of a wff to include the equivalence predicate.
wff 𝑅 Er 𝐴
 
Syntaxcec 6427 Extend the definition of a class to include equivalence class.
class [𝐴]𝑅
 
Syntaxcqs 6428 Extend the definition of a class to include quotient set.
class (𝐴 / 𝑅)
 
Definitiondf-er 6429 Define the equivalence relation predicate. Our notation is not standard. A formal notation doesn't seem to exist in the literature; instead only informal English tends to be used. The present definition, although somewhat cryptic, nicely avoids dummy variables. In dfer2 6430 we derive a more typical definition. We show that an equivalence relation is reflexive, symmetric, and transitive in erref 6449, ersymb 6443, and ertr 6444. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 2-Nov-2015.)
(𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (𝑅 ∪ (𝑅𝑅)) ⊆ 𝑅))
 
Theoremdfer2 6430* Alternate definition of equivalence predicate. (Contributed by NM, 3-Jan-1997.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
 
Definitiondf-ec 6431 Define the 𝑅-coset of 𝐴. Exercise 35 of [Enderton] p. 61. This is called the equivalence class of 𝐴 modulo 𝑅 when 𝑅 is an equivalence relation (i.e. when Er 𝑅; see dfer2 6430). In this case, 𝐴 is a representative (member) of the equivalence class [𝐴]𝑅, which contains all sets that are equivalent to 𝐴. Definition of [Enderton] p. 57 uses the notation [𝐴] (subscript) 𝑅, although we simply follow the brackets by 𝑅 since we don't have subscripted expressions. For an alternate definition, see dfec2 6432. (Contributed by NM, 23-Jul-1995.)
[𝐴]𝑅 = (𝑅 “ {𝐴})
 
Theoremdfec2 6432* Alternate definition of 𝑅-coset of 𝐴. Definition 34 of [Suppes] p. 81. (Contributed by NM, 3-Jan-1997.) (Proof shortened by Mario Carneiro, 9-Jul-2014.)
(𝐴𝑉 → [𝐴]𝑅 = {𝑦𝐴𝑅𝑦})
 
Theoremecexg 6433 An equivalence class modulo a set is a set. (Contributed by NM, 24-Jul-1995.)
(𝑅𝐵 → [𝐴]𝑅 ∈ V)
 
Theoremecexr 6434 An inhabited equivalence class implies the representative is a set. (Contributed by Mario Carneiro, 9-Jul-2014.)
(𝐴 ∈ [𝐵]𝑅𝐵 ∈ V)
 
Definitiondf-qs 6435* Define quotient set. 𝑅 is usually an equivalence relation. Definition of [Enderton] p. 58. (Contributed by NM, 23-Jul-1995.)
(𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅}
 
Theoremereq1 6436 Equality theorem for equivalence predicate. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝑅 = 𝑆 → (𝑅 Er 𝐴𝑆 Er 𝐴))
 
Theoremereq2 6437 Equality theorem for equivalence predicate. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝐴 = 𝐵 → (𝑅 Er 𝐴𝑅 Er 𝐵))
 
Theoremerrel 6438 An equivalence relation is a relation. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 → Rel 𝑅)
 
Theoremerdm 6439 The domain of an equivalence relation. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 → dom 𝑅 = 𝐴)
 
Theoremercl 6440 Elementhood in the field of an equivalence relation. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑𝐴𝑋)
 
Theoremersym 6441 An equivalence relation is symmetric. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑𝐵𝑅𝐴)
 
Theoremercl2 6442 Elementhood in the field of an equivalence relation. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑𝐵𝑋)
 
Theoremersymb 6443 An equivalence relation is symmetric. (Contributed by NM, 30-Jul-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)       (𝜑 → (𝐴𝑅𝐵𝐵𝑅𝐴))
 
Theoremertr 6444 An equivalence relation is transitive. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)       (𝜑 → ((𝐴𝑅𝐵𝐵𝑅𝐶) → 𝐴𝑅𝐶))
 
Theoremertrd 6445 A transitivity relation for equivalences. (Contributed by Mario Carneiro, 9-Jul-2014.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)    &   (𝜑𝐵𝑅𝐶)       (𝜑𝐴𝑅𝐶)
 
Theoremertr2d 6446 A transitivity relation for equivalences. (Contributed by Mario Carneiro, 9-Jul-2014.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)    &   (𝜑𝐵𝑅𝐶)       (𝜑𝐶𝑅𝐴)
 
Theoremertr3d 6447 A transitivity relation for equivalences. (Contributed by Mario Carneiro, 9-Jul-2014.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐵𝑅𝐴)    &   (𝜑𝐵𝑅𝐶)       (𝜑𝐴𝑅𝐶)
 
Theoremertr4d 6448 A transitivity relation for equivalences. (Contributed by Mario Carneiro, 9-Jul-2014.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)    &   (𝜑𝐶𝑅𝐵)       (𝜑𝐴𝑅𝐶)
 
Theoremerref 6449 An equivalence relation is reflexive on its field. Compare Theorem 3M of [Enderton] p. 56. (Contributed by Mario Carneiro, 6-May-2013.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑋)       (𝜑𝐴𝑅𝐴)
 
Theoremercnv 6450 The converse of an equivalence relation is itself. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴𝑅 = 𝑅)
 
Theoremerrn 6451 The range and domain of an equivalence relation are equal. (Contributed by Rodolfo Medina, 11-Oct-2010.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 → ran 𝑅 = 𝐴)
 
Theoremerssxp 6452 An equivalence relation is a subset of the cartesian product of the field. (Contributed by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴𝑅 ⊆ (𝐴 × 𝐴))
 
Theoremerex 6453 An equivalence relation is a set if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Proof shortened by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 → (𝐴𝑉𝑅 ∈ V))
 
Theoremerexb 6454 An equivalence relation is a set if and only if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝑅 Er 𝐴 → (𝑅 ∈ V ↔ 𝐴 ∈ V))
 
Theoremiserd 6455* A reflexive, symmetric, transitive relation is an equivalence relation on its domain. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑 → Rel 𝑅)    &   ((𝜑𝑥𝑅𝑦) → 𝑦𝑅𝑥)    &   ((𝜑 ∧ (𝑥𝑅𝑦𝑦𝑅𝑧)) → 𝑥𝑅𝑧)    &   (𝜑 → (𝑥𝐴𝑥𝑅𝑥))       (𝜑𝑅 Er 𝐴)
 
Theorembrdifun 6456 Evaluate the incomparability relation. (Contributed by Mario Carneiro, 9-Jul-2014.)
𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))       ((𝐴𝑋𝐵𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵𝐵 < 𝐴)))
 
Theoremswoer 6457* Incomparability under a strict weak partial order is an equivalence relation. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)
𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))    &   ((𝜑 ∧ (𝑦𝑋𝑧𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))    &   ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧𝑧 < 𝑦)))       (𝜑𝑅 Er 𝑋)
 
Theoremswoord1 6458* The incomparability equivalence relation is compatible with the original order. (Contributed by Mario Carneiro, 31-Dec-2014.)
𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))    &   ((𝜑 ∧ (𝑦𝑋𝑧𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))    &   ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧𝑧 < 𝑦)))    &   (𝜑𝐵𝑋)    &   (𝜑𝐶𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑 → (𝐴 < 𝐶𝐵 < 𝐶))
 
Theoremswoord2 6459* The incomparability equivalence relation is compatible with the original order. (Contributed by Mario Carneiro, 31-Dec-2014.)
𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))    &   ((𝜑 ∧ (𝑦𝑋𝑧𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))    &   ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧𝑧 < 𝑦)))    &   (𝜑𝐵𝑋)    &   (𝜑𝐶𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑 → (𝐶 < 𝐴𝐶 < 𝐵))
 
Theoremeqerlem 6460* Lemma for eqer 6461. (Contributed by NM, 17-Mar-2008.) (Proof shortened by Mario Carneiro, 6-Dec-2016.)
(𝑥 = 𝑦𝐴 = 𝐵)    &   𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝐴 = 𝐵}       (𝑧𝑅𝑤𝑧 / 𝑥𝐴 = 𝑤 / 𝑥𝐴)
 
Theoremeqer 6461* Equivalence relation involving equality of dependent classes 𝐴(𝑥) and 𝐵(𝑦). (Contributed by NM, 17-Mar-2008.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝑥 = 𝑦𝐴 = 𝐵)    &   𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝐴 = 𝐵}       𝑅 Er V
 
Theoremider 6462 The identity relation is an equivalence relation. (Contributed by NM, 10-May-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Proof shortened by Mario Carneiro, 9-Jul-2014.)
I Er V
 
Theorem0er 6463 The empty set is an equivalence relation on the empty set. (Contributed by Mario Carneiro, 5-Sep-2015.)
∅ Er ∅
 
Theoremeceq1 6464 Equality theorem for equivalence class. (Contributed by NM, 23-Jul-1995.)
(𝐴 = 𝐵 → [𝐴]𝐶 = [𝐵]𝐶)
 
Theoremeceq1d 6465 Equality theorem for equivalence class (deduction form). (Contributed by Jim Kingdon, 31-Dec-2019.)
(𝜑𝐴 = 𝐵)       (𝜑 → [𝐴]𝐶 = [𝐵]𝐶)
 
Theoremeceq2 6466 Equality theorem for equivalence class. (Contributed by NM, 23-Jul-1995.)
(𝐴 = 𝐵 → [𝐶]𝐴 = [𝐶]𝐵)
 
Theoremelecg 6467 Membership in an equivalence class. Theorem 72 of [Suppes] p. 82. (Contributed by Mario Carneiro, 9-Jul-2014.)
((𝐴𝑉𝐵𝑊) → (𝐴 ∈ [𝐵]𝑅𝐵𝑅𝐴))
 
Theoremelec 6468 Membership in an equivalence class. Theorem 72 of [Suppes] p. 82. (Contributed by NM, 23-Jul-1995.)
𝐴 ∈ V    &   𝐵 ∈ V       (𝐴 ∈ [𝐵]𝑅𝐵𝑅𝐴)
 
Theoremrelelec 6469 Membership in an equivalence class when 𝑅 is a relation. (Contributed by Mario Carneiro, 11-Sep-2015.)
(Rel 𝑅 → (𝐴 ∈ [𝐵]𝑅𝐵𝑅𝐴))
 
Theoremecss 6470 An equivalence class is a subset of the domain. (Contributed by NM, 6-Aug-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)       (𝜑 → [𝐴]𝑅𝑋)
 
Theoremecdmn0m 6471* A representative of an inhabited equivalence class belongs to the domain of the equivalence relation. (Contributed by Jim Kingdon, 21-Aug-2019.)
(𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝑥 ∈ [𝐴]𝑅)
 
Theoremereldm 6472 Equality of equivalence classes implies equivalence of domain membership. (Contributed by NM, 28-Jan-1996.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑 → [𝐴]𝑅 = [𝐵]𝑅)       (𝜑 → (𝐴𝑋𝐵𝑋))
 
Theoremerth 6473 Basic property of equivalence relations. Theorem 73 of [Suppes] p. 82. (Contributed by NM, 23-Jul-1995.) (Revised by Mario Carneiro, 6-Jul-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑋)       (𝜑 → (𝐴𝑅𝐵 ↔ [𝐴]𝑅 = [𝐵]𝑅))
 
Theoremerth2 6474 Basic property of equivalence relations. Compare Theorem 73 of [Suppes] p. 82. Assumes membership of the second argument in the domain. (Contributed by NM, 30-Jul-1995.) (Revised by Mario Carneiro, 6-Jul-2015.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐵𝑋)       (𝜑 → (𝐴𝑅𝐵 ↔ [𝐴]𝑅 = [𝐵]𝑅))
 
Theoremerthi 6475 Basic property of equivalence relations. Part of Lemma 3N of [Enderton] p. 57. (Contributed by NM, 30-Jul-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
(𝜑𝑅 Er 𝑋)    &   (𝜑𝐴𝑅𝐵)       (𝜑 → [𝐴]𝑅 = [𝐵]𝑅)
 
Theoremecidsn 6476 An equivalence class modulo the identity relation is a singleton. (Contributed by NM, 24-Oct-2004.)
[𝐴] I = {𝐴}
 
Theoremqseq1 6477 Equality theorem for quotient set. (Contributed by NM, 23-Jul-1995.)
(𝐴 = 𝐵 → (𝐴 / 𝐶) = (𝐵 / 𝐶))
 
Theoremqseq2 6478 Equality theorem for quotient set. (Contributed by NM, 23-Jul-1995.)
(𝐴 = 𝐵 → (𝐶 / 𝐴) = (𝐶 / 𝐵))
 
Theoremelqsg 6479* Closed form of elqs 6480. (Contributed by Rodolfo Medina, 12-Oct-2010.)
(𝐵𝑉 → (𝐵 ∈ (𝐴 / 𝑅) ↔ ∃𝑥𝐴 𝐵 = [𝑥]𝑅))
 
Theoremelqs 6480* Membership in a quotient set. (Contributed by NM, 23-Jul-1995.)
𝐵 ∈ V       (𝐵 ∈ (𝐴 / 𝑅) ↔ ∃𝑥𝐴 𝐵 = [𝑥]𝑅)
 
Theoremelqsi 6481* Membership in a quotient set. (Contributed by NM, 23-Jul-1995.)
(𝐵 ∈ (𝐴 / 𝑅) → ∃𝑥𝐴 𝐵 = [𝑥]𝑅)
 
Theoremecelqsg 6482 Membership of an equivalence class in a quotient set. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 9-Jul-2014.)
((𝑅𝑉𝐵𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅))
 
Theoremecelqsi 6483 Membership of an equivalence class in a quotient set. (Contributed by NM, 25-Jul-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
𝑅 ∈ V       (𝐵𝐴 → [𝐵]𝑅 ∈ (𝐴 / 𝑅))
 
Theoremecopqsi 6484 "Closure" law for equivalence class of ordered pairs. (Contributed by NM, 25-Mar-1996.)
𝑅 ∈ V    &   𝑆 = ((𝐴 × 𝐴) / 𝑅)       ((𝐵𝐴𝐶𝐴) → [⟨𝐵, 𝐶⟩]𝑅𝑆)
 
Theoremqsexg 6485 A quotient set exists. (Contributed by FL, 19-May-2007.) (Revised by Mario Carneiro, 9-Jul-2014.)
(𝐴𝑉 → (𝐴 / 𝑅) ∈ V)
 
Theoremqsex 6486 A quotient set exists. (Contributed by NM, 14-Aug-1995.)
𝐴 ∈ V       (𝐴 / 𝑅) ∈ V
 
Theoremuniqs 6487 The union of a quotient set. (Contributed by NM, 9-Dec-2008.)
(𝑅𝑉 (𝐴 / 𝑅) = (𝑅𝐴))
 
Theoremqsss 6488 A quotient set is a set of subsets of the base set. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝜑𝑅 Er 𝐴)       (𝜑 → (𝐴 / 𝑅) ⊆ 𝒫 𝐴)
 
Theoremuniqs2 6489 The union of a quotient set. (Contributed by Mario Carneiro, 11-Jul-2014.)
(𝜑𝑅 Er 𝐴)    &   (𝜑𝑅𝑉)       (𝜑 (𝐴 / 𝑅) = 𝐴)
 
Theoremsnec 6490 The singleton of an equivalence class. (Contributed by NM, 29-Jan-1999.) (Revised by Mario Carneiro, 9-Jul-2014.)
𝐴 ∈ V       {[𝐴]𝑅} = ({𝐴} / 𝑅)
 
Theoremecqs 6491 Equivalence class in terms of quotient set. (Contributed by NM, 29-Jan-1999.)
𝑅 ∈ V       [𝐴]𝑅 = ({𝐴} / 𝑅)
 
Theoremecid 6492 A set is equal to its converse epsilon coset. (Note: converse epsilon is not an equivalence relation.) (Contributed by NM, 13-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
𝐴 ∈ V       [𝐴] E = 𝐴
 
Theoremecidg 6493 A set is equal to its converse epsilon coset. (Note: converse epsilon is not an equivalence relation.) (Contributed by Jim Kingdon, 8-Jan-2020.)
(𝐴𝑉 → [𝐴] E = 𝐴)
 
Theoremqsid 6494 A set is equal to its quotient set mod converse epsilon. (Note: converse epsilon is not an equivalence relation.) (Contributed by NM, 13-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
(𝐴 / E ) = 𝐴
 
Theoremectocld 6495* Implicit substitution of class for equivalence class. (Contributed by Mario Carneiro, 9-Jul-2014.)
𝑆 = (𝐵 / 𝑅)    &   ([𝑥]𝑅 = 𝐴 → (𝜑𝜓))    &   ((𝜒𝑥𝐵) → 𝜑)       ((𝜒𝐴𝑆) → 𝜓)
 
Theoremectocl 6496* Implicit substitution of class for equivalence class. (Contributed by NM, 23-Jul-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)
𝑆 = (𝐵 / 𝑅)    &   ([𝑥]𝑅 = 𝐴 → (𝜑𝜓))    &   (𝑥𝐵𝜑)       (𝐴𝑆𝜓)
 
Theoremelqsn0m 6497* An element of a quotient set is inhabited. (Contributed by Jim Kingdon, 21-Aug-2019.)
((dom 𝑅 = 𝐴𝐵 ∈ (𝐴 / 𝑅)) → ∃𝑥 𝑥𝐵)
 
Theoremelqsn0 6498 A quotient set doesn't contain the empty set. (Contributed by NM, 24-Aug-1995.)
((dom 𝑅 = 𝐴𝐵 ∈ (𝐴 / 𝑅)) → 𝐵 ≠ ∅)
 
Theoremecelqsdm 6499 Membership of an equivalence class in a quotient set. (Contributed by NM, 30-Jul-1995.)
((dom 𝑅 = 𝐴 ∧ [𝐵]𝑅 ∈ (𝐴 / 𝑅)) → 𝐵𝐴)
 
Theoremxpider 6500 A square Cartesian product is an equivalence relation (in general it's not a poset). (Contributed by FL, 31-Jul-2009.) (Revised by Mario Carneiro, 12-Aug-2015.)
(𝐴 × 𝐴) Er 𝐴
    < 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-13316
  Copyright terms: Public domain < Previous  Next >