HomeHome Intuitionistic Logic Explorer
Theorem List (p. 48 of 114)
< 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 - 4701-4800   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremdmres 4701 The domain of a restriction. Exercise 14 of [TakeutiZaring] p. 25. (Contributed by NM, 1-Aug-1994.)
dom (𝐴𝐵) = (𝐵 ∩ dom 𝐴)
 
Theoremssdmres 4702 A domain restricted to a subclass equals the subclass. (Contributed by NM, 2-Mar-1997.)
(𝐴 ⊆ dom 𝐵 ↔ dom (𝐵𝐴) = 𝐴)
 
Theoremdmresexg 4703 The domain of a restriction to a set exists. (Contributed by NM, 7-Apr-1995.)
(𝐵𝑉 → dom (𝐴𝐵) ∈ V)
 
Theoremresss 4704 A class includes its restriction. Exercise 15 of [TakeutiZaring] p. 25. (Contributed by NM, 2-Aug-1994.)
(𝐴𝐵) ⊆ 𝐴
 
Theoremrescom 4705 Commutative law for restriction. (Contributed by NM, 27-Mar-1998.)
((𝐴𝐵) ↾ 𝐶) = ((𝐴𝐶) ↾ 𝐵)
 
Theoremssres 4706 Subclass theorem for restriction. (Contributed by NM, 16-Aug-1994.)
(𝐴𝐵 → (𝐴𝐶) ⊆ (𝐵𝐶))
 
Theoremssres2 4707 Subclass theorem for restriction. (Contributed by NM, 22-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴𝐵 → (𝐶𝐴) ⊆ (𝐶𝐵))
 
Theoremrelres 4708 A restriction is a relation. Exercise 12 of [TakeutiZaring] p. 25. (Contributed by NM, 2-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Rel (𝐴𝐵)
 
Theoremresabs1 4709 Absorption law for restriction. Exercise 17 of [TakeutiZaring] p. 25. (Contributed by NM, 9-Aug-1994.)
(𝐵𝐶 → ((𝐴𝐶) ↾ 𝐵) = (𝐴𝐵))
 
Theoremresabs2 4710 Absorption law for restriction. (Contributed by NM, 27-Mar-1998.)
(𝐵𝐶 → ((𝐴𝐵) ↾ 𝐶) = (𝐴𝐵))
 
Theoremresidm 4711 Idempotent law for restriction. (Contributed by NM, 27-Mar-1998.)
((𝐴𝐵) ↾ 𝐵) = (𝐴𝐵)
 
Theoremresima 4712 A restriction to an image. (Contributed by NM, 29-Sep-2004.)
((𝐴𝐵) “ 𝐵) = (𝐴𝐵)
 
Theoremresima2 4713 Image under a restricted class. (Contributed by FL, 31-Aug-2009.)
(𝐵𝐶 → ((𝐴𝐶) “ 𝐵) = (𝐴𝐵))
 
Theoremxpssres 4714 Restriction of a constant function (or other cross product). (Contributed by Stefan O'Rear, 24-Jan-2015.)
(𝐶𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵))
 
Theoremelres 4715* Membership in a restriction. (Contributed by Scott Fenton, 17-Mar-2011.)
(𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
 
Theoremelsnres 4716* Memebership in restriction to a singleton. (Contributed by Scott Fenton, 17-Mar-2011.)
𝐶 ∈ V       (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑦(𝐴 = ⟨𝐶, 𝑦⟩ ∧ ⟨𝐶, 𝑦⟩ ∈ 𝐵))
 
Theoremrelssres 4717 Simplification law for restriction. (Contributed by NM, 16-Aug-1994.)
((Rel 𝐴 ∧ dom 𝐴𝐵) → (𝐴𝐵) = 𝐴)
 
Theoremresdm 4718 A relation restricted to its domain equals itself. (Contributed by NM, 12-Dec-2006.)
(Rel 𝐴 → (𝐴 ↾ dom 𝐴) = 𝐴)
 
Theoremresexg 4719 The restriction of a set is a set. (Contributed by NM, 28-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴𝑉 → (𝐴𝐵) ∈ V)
 
Theoremresex 4720 The restriction of a set is a set. (Contributed by Jeff Madsen, 19-Jun-2011.)
𝐴 ∈ V       (𝐴𝐵) ∈ V
 
Theoremresindm 4721 When restricting a relation, intersecting with the domain of the relation has no effect. (Contributed by FL, 6-Oct-2008.)
(Rel 𝐴 → (𝐴 ↾ (𝐵 ∩ dom 𝐴)) = (𝐴𝐵))
 
Theoremresdmdfsn 4722 Restricting a relation to its domain without a set is the same as restricting the relation to the universe without this set. (Contributed by AV, 2-Dec-2018.)
(Rel 𝑅 → (𝑅 ↾ (V ∖ {𝑋})) = (𝑅 ↾ (dom 𝑅 ∖ {𝑋})))
 
Theoremresopab 4723* Restriction of a class abstraction of ordered pairs. (Contributed by NM, 5-Nov-2002.)
({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
 
Theoremresiexg 4724 The existence of a restricted identity function, proved without using the Axiom of Replacement. (Contributed by NM, 13-Jan-2007.)
(𝐴𝑉 → ( I ↾ 𝐴) ∈ V)
 
Theoremiss 4725 A subclass of the identity function is the identity function restricted to its domain. (Contributed by NM, 13-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴 ⊆ I ↔ 𝐴 = ( I ↾ dom 𝐴))
 
Theoremresopab2 4726* Restriction of a class abstraction of ordered pairs. (Contributed by NM, 24-Aug-2007.)
(𝐴𝐵 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
 
Theoremresmpt 4727* Restriction of the mapping operation. (Contributed by Mario Carneiro, 15-Jul-2013.)
(𝐵𝐴 → ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥𝐵𝐶))
 
Theoremresmpt3 4728* Unconditional restriction of the mapping operation. (Contributed by Stefan O'Rear, 24-Jan-2015.) (Proof shortened by Mario Carneiro, 22-Mar-2015.)
((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
 
Theoremresmptf 4729 Restriction of the mapping operation. (Contributed by Thierry Arnoux, 28-Mar-2017.)
𝑥𝐴    &   𝑥𝐵       (𝐵𝐴 → ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥𝐵𝐶))
 
Theoremresmptd 4730* Restriction of the mapping operation, deduction form. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐵𝐴)       (𝜑 → ((𝑥𝐴𝐶) ↾ 𝐵) = (𝑥𝐵𝐶))
 
Theoremdfres2 4731* Alternate definition of the restriction operation. (Contributed by Mario Carneiro, 5-Nov-2013.)
(𝑅𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑥𝑅𝑦)}
 
Theoremopabresid 4732* The restricted identity expressed with the class builder. (Contributed by FL, 25-Apr-2012.)
{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝑥)} = ( I ↾ 𝐴)
 
Theoremmptresid 4733* The restricted identity expressed with the maps-to notation. (Contributed by FL, 25-Apr-2012.)
(𝑥𝐴𝑥) = ( I ↾ 𝐴)
 
Theoremdmresi 4734 The domain of a restricted identity function. (Contributed by NM, 27-Aug-2004.)
dom ( I ↾ 𝐴) = 𝐴
 
Theoremresid 4735 Any relation restricted to the universe is itself. (Contributed by NM, 16-Mar-2004.)
(Rel 𝐴 → (𝐴 ↾ V) = 𝐴)
 
Theoremimaeq1 4736 Equality theorem for image. (Contributed by NM, 14-Aug-1994.)
(𝐴 = 𝐵 → (𝐴𝐶) = (𝐵𝐶))
 
Theoremimaeq2 4737 Equality theorem for image. (Contributed by NM, 14-Aug-1994.)
(𝐴 = 𝐵 → (𝐶𝐴) = (𝐶𝐵))
 
Theoremimaeq1i 4738 Equality theorem for image. (Contributed by NM, 21-Dec-2008.)
𝐴 = 𝐵       (𝐴𝐶) = (𝐵𝐶)
 
Theoremimaeq2i 4739 Equality theorem for image. (Contributed by NM, 21-Dec-2008.)
𝐴 = 𝐵       (𝐶𝐴) = (𝐶𝐵)
 
Theoremimaeq1d 4740 Equality theorem for image. (Contributed by FL, 15-Dec-2006.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐴𝐶) = (𝐵𝐶))
 
Theoremimaeq2d 4741 Equality theorem for image. (Contributed by FL, 15-Dec-2006.)
(𝜑𝐴 = 𝐵)       (𝜑 → (𝐶𝐴) = (𝐶𝐵))
 
Theoremimaeq12d 4742 Equality theorem for image. (Contributed by Mario Carneiro, 4-Dec-2016.)
(𝜑𝐴 = 𝐵)    &   (𝜑𝐶 = 𝐷)       (𝜑 → (𝐴𝐶) = (𝐵𝐷))
 
Theoremdfima2 4743* Alternate definition of image. Compare definition (d) of [Enderton] p. 44. (Contributed by NM, 19-Apr-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐵 𝑥𝐴𝑦}
 
Theoremdfima3 4744* Alternate definition of image. Compare definition (d) of [Enderton] p. 44. (Contributed by NM, 14-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴𝐵) = {𝑦 ∣ ∃𝑥(𝑥𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐴)}
 
Theoremelimag 4745* Membership in an image. Theorem 34 of [Suppes] p. 65. (Contributed by NM, 20-Jan-2007.)
(𝐴𝑉 → (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥𝐶 𝑥𝐵𝐴))
 
Theoremelima 4746* Membership in an image. Theorem 34 of [Suppes] p. 65. (Contributed by NM, 19-Apr-2004.)
𝐴 ∈ V       (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥𝐶 𝑥𝐵𝐴)
 
Theoremelima2 4747* Membership in an image. Theorem 34 of [Suppes] p. 65. (Contributed by NM, 11-Aug-2004.)
𝐴 ∈ V       (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥(𝑥𝐶𝑥𝐵𝐴))
 
Theoremelima3 4748* Membership in an image. Theorem 34 of [Suppes] p. 65. (Contributed by NM, 14-Aug-1994.)
𝐴 ∈ V       (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥(𝑥𝐶 ∧ ⟨𝑥, 𝐴⟩ ∈ 𝐵))
 
Theoremnfima 4749 Bound-variable hypothesis builder for image. (Contributed by NM, 30-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
𝑥𝐴    &   𝑥𝐵       𝑥(𝐴𝐵)
 
Theoremnfimad 4750 Deduction version of bound-variable hypothesis builder nfima 4749. (Contributed by FL, 15-Dec-2006.) (Revised by Mario Carneiro, 15-Oct-2016.)
(𝜑𝑥𝐴)    &   (𝜑𝑥𝐵)       (𝜑𝑥(𝐴𝐵))
 
Theoremimadmrn 4751 The image of the domain of a class is the range of the class. (Contributed by NM, 14-Aug-1994.)
(𝐴 “ dom 𝐴) = ran 𝐴
 
Theoremimassrn 4752 The image of a class is a subset of its range. Theorem 3.16(xi) of [Monk1] p. 39. (Contributed by NM, 31-Mar-1995.)
(𝐴𝐵) ⊆ ran 𝐴
 
Theoremimaexg 4753 The image of a set is a set. Theorem 3.17 of [Monk1] p. 39. (Contributed by NM, 24-Jul-1995.)
(𝐴𝑉 → (𝐴𝐵) ∈ V)
 
Theoremimaex 4754 The image of a set is a set. Theorem 3.17 of [Monk1] p. 39. (Contributed by JJ, 24-Sep-2021.)
𝐴 ∈ V       (𝐴𝐵) ∈ V
 
Theoremimai 4755 Image under the identity relation. Theorem 3.16(viii) of [Monk1] p. 38. (Contributed by NM, 30-Apr-1998.)
( I “ 𝐴) = 𝐴
 
Theoremrnresi 4756 The range of the restricted identity function. (Contributed by NM, 27-Aug-2004.)
ran ( I ↾ 𝐴) = 𝐴
 
Theoremresiima 4757 The image of a restriction of the identity function. (Contributed by FL, 31-Dec-2006.)
(𝐵𝐴 → (( I ↾ 𝐴) “ 𝐵) = 𝐵)
 
Theoremima0 4758 Image of the empty set. Theorem 3.16(ii) of [Monk1] p. 38. (Contributed by NM, 20-May-1998.)
(𝐴 “ ∅) = ∅
 
Theorem0ima 4759 Image under the empty relation. (Contributed by FL, 11-Jan-2007.)
(∅ “ 𝐴) = ∅
 
Theoremcsbima12g 4760 Move class substitution in and out of the image of a function. (Contributed by FL, 15-Dec-2006.) (Proof shortened by Mario Carneiro, 4-Dec-2016.)
(𝐴𝐶𝐴 / 𝑥(𝐹𝐵) = (𝐴 / 𝑥𝐹𝐴 / 𝑥𝐵))
 
Theoremimadisj 4761 A class whose image under another is empty is disjoint with the other's domain. (Contributed by FL, 24-Jan-2007.)
((𝐴𝐵) = ∅ ↔ (dom 𝐴𝐵) = ∅)
 
Theoremcnvimass 4762 A preimage under any class is included in the domain of the class. (Contributed by FL, 29-Jan-2007.)
(𝐴𝐵) ⊆ dom 𝐴
 
Theoremcnvimarndm 4763 The preimage of the range of a class is the domain of the class. (Contributed by Jeff Hankins, 15-Jul-2009.)
(𝐴 “ ran 𝐴) = dom 𝐴
 
Theoremimasng 4764* The image of a singleton. (Contributed by NM, 8-May-2005.)
(𝐴𝐵 → (𝑅 “ {𝐴}) = {𝑦𝐴𝑅𝑦})
 
Theoremelreimasng 4765 Elementhood in the image of a singleton. (Contributed by Jim Kingdon, 10-Dec-2018.)
((Rel 𝑅𝐴𝑉) → (𝐵 ∈ (𝑅 “ {𝐴}) ↔ 𝐴𝑅𝐵))
 
Theoremelimasn 4766 Membership in an image of a singleton. (Contributed by NM, 15-Mar-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
𝐵 ∈ V    &   𝐶 ∈ V       (𝐶 ∈ (𝐴 “ {𝐵}) ↔ ⟨𝐵, 𝐶⟩ ∈ 𝐴)
 
Theoremelimasng 4767 Membership in an image of a singleton. (Contributed by Raph Levien, 21-Oct-2006.)
((𝐵𝑉𝐶𝑊) → (𝐶 ∈ (𝐴 “ {𝐵}) ↔ ⟨𝐵, 𝐶⟩ ∈ 𝐴))
 
Theoremargs 4768* Two ways to express the class of unique-valued arguments of 𝐹, which is the same as the domain of 𝐹 whenever 𝐹 is a function. The left-hand side of the equality is from Definition 10.2 of [Quine] p. 65. Quine uses the notation "arg 𝐹 " for this class (for which we have no separate notation). (Contributed by NM, 8-May-2005.)
{𝑥 ∣ ∃𝑦(𝐹 “ {𝑥}) = {𝑦}} = {𝑥 ∣ ∃!𝑦 𝑥𝐹𝑦}
 
Theoremeliniseg 4769 Membership in an initial segment. The idiom (𝐴 “ {𝐵}), meaning {𝑥𝑥𝐴𝐵}, is used to specify an initial segment in (for example) Definition 6.21 of [TakeutiZaring] p. 30. (Contributed by NM, 28-Apr-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
𝐶 ∈ V       (𝐵𝑉 → (𝐶 ∈ (𝐴 “ {𝐵}) ↔ 𝐶𝐴𝐵))
 
Theoremepini 4770 Any set is equal to its preimage under the converse epsilon relation. (Contributed by Mario Carneiro, 9-Mar-2013.)
𝐴 ∈ V       ( E “ {𝐴}) = 𝐴
 
Theoreminiseg 4771* An idiom that signifies an initial segment of an ordering, used, for example, in Definition 6.21 of [TakeutiZaring] p. 30. (Contributed by NM, 28-Apr-2004.)
(𝐵𝑉 → (𝐴 “ {𝐵}) = {𝑥𝑥𝐴𝐵})
 
Theoremdfse2 4772* Alternate definition of set-like relation. (Contributed by Mario Carneiro, 23-Jun-2015.)
(𝑅 Se 𝐴 ↔ ∀𝑥𝐴 (𝐴 ∩ (𝑅 “ {𝑥})) ∈ V)
 
Theoremexse2 4773 Any set relation is set-like. (Contributed by Mario Carneiro, 22-Jun-2015.)
(𝑅𝑉𝑅 Se 𝐴)
 
Theoremimass1 4774 Subset theorem for image. (Contributed by NM, 16-Mar-2004.)
(𝐴𝐵 → (𝐴𝐶) ⊆ (𝐵𝐶))
 
Theoremimass2 4775 Subset theorem for image. Exercise 22(a) of [Enderton] p. 53. (Contributed by NM, 22-Mar-1998.)
(𝐴𝐵 → (𝐶𝐴) ⊆ (𝐶𝐵))
 
Theoremndmima 4776 The image of a singleton outside the domain is empty. (Contributed by NM, 22-May-1998.)
𝐴 ∈ dom 𝐵 → (𝐵 “ {𝐴}) = ∅)
 
Theoremrelcnv 4777 A converse is a relation. Theorem 12 of [Suppes] p. 62. (Contributed by NM, 29-Oct-1996.)
Rel 𝐴
 
Theoremrelbrcnvg 4778 When 𝑅 is a relation, the sethood assumptions on brcnv 4587 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.)
(Rel 𝑅 → (𝐴𝑅𝐵𝐵𝑅𝐴))
 
Theoremrelbrcnv 4779 When 𝑅 is a relation, the sethood assumptions on brcnv 4587 can be omitted. (Contributed by Mario Carneiro, 28-Apr-2015.)
Rel 𝑅       (𝐴𝑅𝐵𝐵𝑅𝐴)
 
Theoremcotr 4780* Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51. (Contributed by NM, 27-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
 
Theoremissref 4781* Two ways to state a relation is reflexive. Adapted from Tarski. (Contributed by FL, 15-Jan-2012.) (Revised by NM, 30-Mar-2016.)
(( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
 
Theoremcnvsym 4782* Two ways of saying a relation is symmetric. Similar to definition of symmetry in [Schechter] p. 51. (Contributed by NM, 28-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝑅𝑅 ↔ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥))
 
Theoremintasym 4783* Two ways of saying a relation is antisymmetric. Definition of antisymmetry in [Schechter] p. 51. (Contributed by NM, 9-Sep-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝑅𝑅) ⊆ I ↔ ∀𝑥𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) → 𝑥 = 𝑦))
 
Theoremasymref 4784* Two ways of saying a relation is antisymmetric and reflexive. 𝑅 is the field of a relation by relfld 4925. (Contributed by NM, 6-May-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦))
 
Theoremintirr 4785* Two ways of saying a relation is irreflexive. Definition of irreflexivity in [Schechter] p. 51. (Contributed by NM, 9-Sep-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
 
Theorembrcodir 4786* Two ways of saying that two elements have an upper bound. (Contributed by Mario Carneiro, 3-Nov-2015.)
((𝐴𝑉𝐵𝑊) → (𝐴(𝑅𝑅)𝐵 ↔ ∃𝑧(𝐴𝑅𝑧𝐵𝑅𝑧)))
 
Theoremcodir 4787* Two ways of saying a relation is directed. (Contributed by Mario Carneiro, 22-Nov-2013.)
((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝐴𝑦𝐵𝑧(𝑥𝑅𝑧𝑦𝑅𝑧))
 
Theoremqfto 4788* A quantifier-free way of expressing the total order predicate. (Contributed by Mario Carneiro, 22-Nov-2013.)
((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥))
 
Theoremxpidtr 4789 A square cross product (𝐴 × 𝐴) is a transitive relation. (Contributed by FL, 31-Jul-2009.)
((𝐴 × 𝐴) ∘ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
 
Theoremtrin2 4790 The intersection of two transitive classes is transitive. (Contributed by FL, 31-Jul-2009.)
(((𝑅𝑅) ⊆ 𝑅 ∧ (𝑆𝑆) ⊆ 𝑆) → ((𝑅𝑆) ∘ (𝑅𝑆)) ⊆ (𝑅𝑆))
 
Theorempoirr2 4791 A partial order relation is irreflexive. (Contributed by Mario Carneiro, 2-Nov-2015.)
(𝑅 Po 𝐴 → (𝑅 ∩ ( I ↾ 𝐴)) = ∅)
 
Theoremtrinxp 4792 The relation induced by a transitive relation on a part of its field is transitive. (Taking the intersection of a relation with a square cross product is a way to restrict it to a subset of its field.) (Contributed by FL, 31-Jul-2009.)
((𝑅𝑅) ⊆ 𝑅 → ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ (𝑅 ∩ (𝐴 × 𝐴)))
 
Theoremsoirri 4793 A strict order relation is irreflexive. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)
𝑅 Or 𝑆    &   𝑅 ⊆ (𝑆 × 𝑆)        ¬ 𝐴𝑅𝐴
 
Theoremsotri 4794 A strict order relation is a transitive relation. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)
𝑅 Or 𝑆    &   𝑅 ⊆ (𝑆 × 𝑆)       ((𝐴𝑅𝐵𝐵𝑅𝐶) → 𝐴𝑅𝐶)
 
Theoremson2lpi 4795 A strict order relation has no 2-cycle loops. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)
𝑅 Or 𝑆    &   𝑅 ⊆ (𝑆 × 𝑆)        ¬ (𝐴𝑅𝐵𝐵𝑅𝐴)
 
Theoremsotri2 4796 A transitivity relation. (Read ¬ B < A and B < C implies A < C .) (Contributed by Mario Carneiro, 10-May-2013.)
𝑅 Or 𝑆    &   𝑅 ⊆ (𝑆 × 𝑆)       ((𝐴𝑆 ∧ ¬ 𝐵𝑅𝐴𝐵𝑅𝐶) → 𝐴𝑅𝐶)
 
Theoremsotri3 4797 A transitivity relation. (Read A < B and ¬ C < B implies A < C .) (Contributed by Mario Carneiro, 10-May-2013.)
𝑅 Or 𝑆    &   𝑅 ⊆ (𝑆 × 𝑆)       ((𝐶𝑆𝐴𝑅𝐵 ∧ ¬ 𝐶𝑅𝐵) → 𝐴𝑅𝐶)
 
Theorempoleloe 4798 Express "less than or equals" for general strict orders. (Contributed by Stefan O'Rear, 17-Jan-2015.)
(𝐵𝑉 → (𝐴(𝑅 ∪ I )𝐵 ↔ (𝐴𝑅𝐵𝐴 = 𝐵)))
 
Theorempoltletr 4799 Transitive law for general strict orders. (Contributed by Stefan O'Rear, 17-Jan-2015.)
((𝑅 Po 𝑋 ∧ (𝐴𝑋𝐵𝑋𝐶𝑋)) → ((𝐴𝑅𝐵𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶))
 
Theoremcnvopab 4800* The converse of a class abstraction of ordered pairs. (Contributed by NM, 11-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
{⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑦, 𝑥⟩ ∣ 𝜑}
    < 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-11370
  Copyright terms: Public domain < Previous  Next >