 Home Intuitionistic Logic ExplorerTheorem List (p. 49 of 111) < 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 - 4801-4900   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremdjudisj 4801* Disjoint unions with disjoint index sets are disjoint. (Contributed by Stefan O'Rear, 21-Nov-2014.)
((𝐴𝐵) = ∅ → ( 𝑥𝐴 ({𝑥} × 𝐶) ∩ 𝑦𝐵 ({𝑦} × 𝐷)) = ∅)

Theoremresdisj 4802 A double restriction to disjoint classes is the empty set. (Contributed by NM, 7-Oct-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝐴𝐵) = ∅ → ((𝐶𝐴) ↾ 𝐵) = ∅)

Theoremrnxpm 4803* The range of a cross product. Part of Theorem 3.13(x) of [Monk1] p. 37, with non-empty changed to inhabited. (Contributed by Jim Kingdon, 12-Dec-2018.)
(∃𝑥 𝑥𝐴 → ran (𝐴 × 𝐵) = 𝐵)

Theoremdmxpss 4804 The domain of a cross product is a subclass of the first factor. (Contributed by NM, 19-Mar-2007.)
dom (𝐴 × 𝐵) ⊆ 𝐴

Theoremrnxpss 4805 The range of a cross product is a subclass of the second factor. (Contributed by NM, 16-Jan-2006.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
ran (𝐴 × 𝐵) ⊆ 𝐵

Theoremrnxpid 4806 The range of a square cross product. (Contributed by FL, 17-May-2010.)
ran (𝐴 × 𝐴) = 𝐴

Theoremssxpbm 4807* A cross-product subclass relationship is equivalent to the relationship for its components. (Contributed by Jim Kingdon, 12-Dec-2018.)
(∃𝑥 𝑥 ∈ (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝐶 × 𝐷) ↔ (𝐴𝐶𝐵𝐷)))

Theoremssxp1 4808* Cross product subset cancellation. (Contributed by Jim Kingdon, 14-Dec-2018.)
(∃𝑥 𝑥𝐶 → ((𝐴 × 𝐶) ⊆ (𝐵 × 𝐶) ↔ 𝐴𝐵))

Theoremssxp2 4809* Cross product subset cancellation. (Contributed by Jim Kingdon, 14-Dec-2018.)
(∃𝑥 𝑥𝐶 → ((𝐶 × 𝐴) ⊆ (𝐶 × 𝐵) ↔ 𝐴𝐵))

Theoremxp11m 4810* The cross product of inhabited classes is one-to-one. (Contributed by Jim Kingdon, 13-Dec-2018.)
((∃𝑥 𝑥𝐴 ∧ ∃𝑦 𝑦𝐵) → ((𝐴 × 𝐵) = (𝐶 × 𝐷) ↔ (𝐴 = 𝐶𝐵 = 𝐷)))

Theoremxpcanm 4811* Cancellation law for cross-product. (Contributed by Jim Kingdon, 14-Dec-2018.)
(∃𝑥 𝑥𝐶 → ((𝐶 × 𝐴) = (𝐶 × 𝐵) ↔ 𝐴 = 𝐵))

Theoremxpcan2m 4812* Cancellation law for cross-product. (Contributed by Jim Kingdon, 14-Dec-2018.)
(∃𝑥 𝑥𝐶 → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵))

Theoremxpexr2m 4813* If a nonempty cross product is a set, so are both of its components. (Contributed by Jim Kingdon, 14-Dec-2018.)
(((𝐴 × 𝐵) ∈ 𝐶 ∧ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵)) → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Theoremssrnres 4814 Subset of the range of a restriction. (Contributed by NM, 16-Jan-2006.)
(𝐵 ⊆ ran (𝐶𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)

Theoremrninxp 4815* Range of the intersection with a cross product. (Contributed by NM, 17-Jan-2006.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ ∀𝑦𝐵𝑥𝐴 𝑥𝐶𝑦)

Theoremdminxp 4816* Domain of the intersection with a cross product. (Contributed by NM, 17-Jan-2006.)
(dom (𝐶 ∩ (𝐴 × 𝐵)) = 𝐴 ↔ ∀𝑥𝐴𝑦𝐵 𝑥𝐶𝑦)

Theoremimainrect 4817 Image of a relation restricted to a rectangular region. (Contributed by Stefan O'Rear, 19-Feb-2015.)
((𝐺 ∩ (𝐴 × 𝐵)) “ 𝑌) = ((𝐺 “ (𝑌𝐴)) ∩ 𝐵)

Theoremxpima1 4818 The image by a cross product. (Contributed by Thierry Arnoux, 16-Dec-2017.)
((𝐴𝐶) = ∅ → ((𝐴 × 𝐵) “ 𝐶) = ∅)

Theoremxpima2m 4819* The image by a cross product. (Contributed by Thierry Arnoux, 16-Dec-2017.)
(∃𝑥 𝑥 ∈ (𝐴𝐶) → ((𝐴 × 𝐵) “ 𝐶) = 𝐵)

Theoremxpimasn 4820 The image of a singleton by a cross product. (Contributed by Thierry Arnoux, 14-Jan-2018.)
(𝑋𝐴 → ((𝐴 × 𝐵) “ {𝑋}) = 𝐵)

Theoremcnvcnv3 4821* The set of all ordered pairs in a class is the same as the double converse. (Contributed by Mario Carneiro, 16-Aug-2015.)
𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦}

Theoremdfrel2 4822 Alternate definition of relation. Exercise 2 of [TakeutiZaring] p. 25. (Contributed by NM, 29-Dec-1996.)
(Rel 𝑅𝑅 = 𝑅)

Theoremdfrel4v 4823* A relation can be expressed as the set of ordered pairs in it. (Contributed by Mario Carneiro, 16-Aug-2015.)
(Rel 𝑅𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝑅𝑦})

Theoremcnvcnv 4824 The double converse of a class strips out all elements that are not ordered pairs. (Contributed by NM, 8-Dec-2003.)
𝐴 = (𝐴 ∩ (V × V))

Theoremcnvcnv2 4825 The double converse of a class equals its restriction to the universe. (Contributed by NM, 8-Oct-2007.)
𝐴 = (𝐴 ↾ V)

Theoremcnvcnvss 4826 The double converse of a class is a subclass. Exercise 2 of [TakeutiZaring] p. 25. (Contributed by NM, 23-Jul-2004.)
𝐴𝐴

Theoremcnveqb 4827 Equality theorem for converse. (Contributed by FL, 19-Sep-2011.)
((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵𝐴 = 𝐵))

Theoremcnveq0 4828 A relation empty iff its converse is empty. (Contributed by FL, 19-Sep-2011.)
(Rel 𝐴 → (𝐴 = ∅ ↔ 𝐴 = ∅))

Theoremdfrel3 4829 Alternate definition of relation. (Contributed by NM, 14-May-2008.)
(Rel 𝑅 ↔ (𝑅 ↾ V) = 𝑅)

Theoremdmresv 4830 The domain of a universal restriction. (Contributed by NM, 14-May-2008.)
dom (𝐴 ↾ V) = dom 𝐴

Theoremrnresv 4831 The range of a universal restriction. (Contributed by NM, 14-May-2008.)
ran (𝐴 ↾ V) = ran 𝐴

Theoremdfrn4 4832 Range defined in terms of image. (Contributed by NM, 14-May-2008.)
ran 𝐴 = (𝐴 “ V)

Theoremcsbrng 4833 Distribute proper substitution through the range of a class. (Contributed by Alan Sare, 10-Nov-2012.)
(𝐴𝑉𝐴 / 𝑥ran 𝐵 = ran 𝐴 / 𝑥𝐵)

Theoremrescnvcnv 4834 The restriction of the double converse of a class. (Contributed by NM, 8-Apr-2007.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴𝐵) = (𝐴𝐵)

Theoremcnvcnvres 4835 The double converse of the restriction of a class. (Contributed by NM, 3-Jun-2007.)
(𝐴𝐵) = (𝐴𝐵)

Theoremimacnvcnv 4836 The image of the double converse of a class. (Contributed by NM, 8-Apr-2007.)
(𝐴𝐵) = (𝐴𝐵)

Theoremdmsnm 4837* The domain of a singleton is inhabited iff the singleton argument is an ordered pair. (Contributed by Jim Kingdon, 15-Dec-2018.)
(𝐴 ∈ (V × V) ↔ ∃𝑥 𝑥 ∈ dom {𝐴})

Theoremrnsnm 4838* The range of a singleton is inhabited iff the singleton argument is an ordered pair. (Contributed by Jim Kingdon, 15-Dec-2018.)
(𝐴 ∈ (V × V) ↔ ∃𝑥 𝑥 ∈ ran {𝐴})

Theoremdmsn0 4839 The domain of the singleton of the empty set is empty. (Contributed by NM, 30-Jan-2004.)
dom {∅} = ∅

Theoremcnvsn0 4840 The converse of the singleton of the empty set is empty. (Contributed by Mario Carneiro, 30-Aug-2015.)
{∅} = ∅

Theoremdmsn0el 4841 The domain of a singleton is empty if the singleton's argument contains the empty set. (Contributed by NM, 15-Dec-2008.)
(∅ ∈ 𝐴 → dom {𝐴} = ∅)

Theoremrelsn2m 4842* A singleton is a relation iff it has an inhabited domain. (Contributed by Jim Kingdon, 16-Dec-2018.)
𝐴 ∈ V       (Rel {𝐴} ↔ ∃𝑥 𝑥 ∈ dom {𝐴})

Theoremdmsnopg 4843 The domain of a singleton of an ordered pair is the singleton of the first member. (Contributed by Mario Carneiro, 26-Apr-2015.)
(𝐵𝑉 → dom {⟨𝐴, 𝐵⟩} = {𝐴})

Theoremdmpropg 4844 The domain of an unordered pair of ordered pairs. (Contributed by Mario Carneiro, 26-Apr-2015.)
((𝐵𝑉𝐷𝑊) → dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {𝐴, 𝐶})

Theoremdmsnop 4845 The domain of a singleton of an ordered pair is the singleton of the first member. (Contributed by NM, 30-Jan-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Revised by Mario Carneiro, 26-Apr-2015.)
𝐵 ∈ V       dom {⟨𝐴, 𝐵⟩} = {𝐴}

Theoremdmprop 4846 The domain of an unordered pair of ordered pairs. (Contributed by NM, 13-Sep-2011.)
𝐵 ∈ V    &   𝐷 ∈ V       dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {𝐴, 𝐶}

Theoremdmtpop 4847 The domain of an unordered triple of ordered pairs. (Contributed by NM, 14-Sep-2011.)
𝐵 ∈ V    &   𝐷 ∈ V    &   𝐹 ∈ V       dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩, ⟨𝐸, 𝐹⟩} = {𝐴, 𝐶, 𝐸}

Theoremcnvcnvsn 4848 Double converse of a singleton of an ordered pair. (Unlike cnvsn 4854, this does not need any sethood assumptions on 𝐴 and 𝐵.) (Contributed by Mario Carneiro, 26-Apr-2015.)
{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Theoremdmsnsnsng 4849 The domain of the singleton of the singleton of a singleton. (Contributed by Jim Kingdon, 16-Dec-2018.)
(𝐴 ∈ V → dom {{{𝐴}}} = {𝐴})

Theoremrnsnopg 4850 The range of a singleton of an ordered pair is the singleton of the second member. (Contributed by NM, 24-Jul-2004.) (Revised by Mario Carneiro, 30-Apr-2015.)
(𝐴𝑉 → ran {⟨𝐴, 𝐵⟩} = {𝐵})

Theoremrnpropg 4851 The range of a pair of ordered pairs is the pair of second members. (Contributed by Thierry Arnoux, 3-Jan-2017.)
((𝐴𝑉𝐵𝑊) → ran {⟨𝐴, 𝐶⟩, ⟨𝐵, 𝐷⟩} = {𝐶, 𝐷})

Theoremrnsnop 4852 The range of a singleton of an ordered pair is the singleton of the second member. (Contributed by NM, 24-Jul-2004.) (Revised by Mario Carneiro, 26-Apr-2015.)
𝐴 ∈ V       ran {⟨𝐴, 𝐵⟩} = {𝐵}

Theoremop1sta 4853 Extract the first member of an ordered pair. (See op2nda 4856 to extract the second member and op1stb 4256 for an alternate version.) (Contributed by Raph Levien, 4-Dec-2003.)
𝐴 ∈ V    &   𝐵 ∈ V        dom {⟨𝐴, 𝐵⟩} = 𝐴

Theoremcnvsn 4854 Converse of a singleton of an ordered pair. (Contributed by NM, 11-May-1998.) (Revised by Mario Carneiro, 26-Apr-2015.)
𝐴 ∈ V    &   𝐵 ∈ V       {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩}

Theoremop2ndb 4855 Extract the second member of an ordered pair. Theorem 5.12(ii) of [Monk1] p. 52. (See op1stb 4256 to extract the first member and op2nda 4856 for an alternate version.) (Contributed by NM, 25-Nov-2003.)
𝐴 ∈ V    &   𝐵 ∈ V        {⟨𝐴, 𝐵⟩} = 𝐵

Theoremop2nda 4856 Extract the second member of an ordered pair. (See op1sta 4853 to extract the first member and op2ndb 4855 for an alternate version.) (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
𝐴 ∈ V    &   𝐵 ∈ V        ran {⟨𝐴, 𝐵⟩} = 𝐵

Theoremcnvsng 4857 Converse of a singleton of an ordered pair. (Contributed by NM, 23-Jan-2015.)
((𝐴𝑉𝐵𝑊) → {⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})

Theoremopswapg 4858 Swap the members of an ordered pair. (Contributed by Jim Kingdon, 16-Dec-2018.)
((𝐴𝑉𝐵𝑊) → {⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩)

Theoremelxp4 4859 Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp5 4860. (Contributed by NM, 17-Feb-2004.)
(𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ dom {𝐴}, ran {𝐴}⟩ ∧ ( dom {𝐴} ∈ 𝐵 ran {𝐴} ∈ 𝐶)))

Theoremelxp5 4860 Membership in a cross product requiring no quantifiers or dummy variables. Provides a slightly shorter version of elxp4 4859 when the double intersection does not create class existence problems (caused by int0 3671). (Contributed by NM, 1-Aug-2004.)
(𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨ 𝐴, ran {𝐴}⟩ ∧ ( 𝐴𝐵 ran {𝐴} ∈ 𝐶)))

Theoremcnvresima 4861 An image under the converse of a restriction. (Contributed by Jeff Hankins, 12-Jul-2009.)
((𝐹𝐴) “ 𝐵) = ((𝐹𝐵) ∩ 𝐴)

Theoremresdm2 4862 A class restricted to its domain equals its double converse. (Contributed by NM, 8-Apr-2007.)
(𝐴 ↾ dom 𝐴) = 𝐴

Theoremresdmres 4863 Restriction to the domain of a restriction. (Contributed by NM, 8-Apr-2007.)
(𝐴 ↾ dom (𝐴𝐵)) = (𝐴𝐵)

Theoremimadmres 4864 The image of the domain of a restriction. (Contributed by NM, 8-Apr-2007.)
(𝐴 “ dom (𝐴𝐵)) = (𝐴𝐵)

Theoremmptpreima 4865* The preimage of a function in maps-to notation. (Contributed by Stefan O'Rear, 25-Jan-2015.)
𝐹 = (𝑥𝐴𝐵)       (𝐹𝐶) = {𝑥𝐴𝐵𝐶}

Theoremmptiniseg 4866* Converse singleton image of a function defined by maps-to. (Contributed by Stefan O'Rear, 25-Jan-2015.)
𝐹 = (𝑥𝐴𝐵)       (𝐶𝑉 → (𝐹 “ {𝐶}) = {𝑥𝐴𝐵 = 𝐶})

Theoremdmmpt 4867 The domain of the mapping operation in general. (Contributed by NM, 16-May-1995.) (Revised by Mario Carneiro, 22-Mar-2015.)
𝐹 = (𝑥𝐴𝐵)       dom 𝐹 = {𝑥𝐴𝐵 ∈ V}

Theoremdmmptss 4868* The domain of a mapping is a subset of its base class. (Contributed by Scott Fenton, 17-Jun-2013.)
𝐹 = (𝑥𝐴𝐵)       dom 𝐹𝐴

Theoremdmmptg 4869* The domain of the mapping operation is the stated domain, if the function value is always a set. (Contributed by Mario Carneiro, 9-Feb-2013.) (Revised by Mario Carneiro, 14-Sep-2013.)
(∀𝑥𝐴 𝐵𝑉 → dom (𝑥𝐴𝐵) = 𝐴)

Theoremrelco 4870 A composition is a relation. Exercise 24 of [TakeutiZaring] p. 25. (Contributed by NM, 26-Jan-1997.)
Rel (𝐴𝐵)

Theoremdfco2 4871* Alternate definition of a class composition, using only one bound variable. (Contributed by NM, 19-Dec-2008.)
(𝐴𝐵) = 𝑥 ∈ V ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥}))

Theoremdfco2a 4872* Generalization of dfco2 4871, where 𝐶 can have any value between dom 𝐴 ∩ ran 𝐵 and V. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((dom 𝐴 ∩ ran 𝐵) ⊆ 𝐶 → (𝐴𝐵) = 𝑥𝐶 ((𝐵 “ {𝑥}) × (𝐴 “ {𝑥})))

Theoremcoundi 4873 Class composition distributes over union. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(𝐴 ∘ (𝐵𝐶)) = ((𝐴𝐵) ∪ (𝐴𝐶))

Theoremcoundir 4874 Class composition distributes over union. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
((𝐴𝐵) ∘ 𝐶) = ((𝐴𝐶) ∪ (𝐵𝐶))

Theoremcores 4875 Restricted first member of a class composition. (Contributed by NM, 12-Oct-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
(ran 𝐵𝐶 → ((𝐴𝐶) ∘ 𝐵) = (𝐴𝐵))

Theoremresco 4876 Associative law for the restriction of a composition. (Contributed by NM, 12-Dec-2006.)
((𝐴𝐵) ↾ 𝐶) = (𝐴 ∘ (𝐵𝐶))

Theoremimaco 4877 Image of the composition of two classes. (Contributed by Jason Orendorff, 12-Dec-2006.)
((𝐴𝐵) “ 𝐶) = (𝐴 “ (𝐵𝐶))

Theoremrnco 4878 The range of the composition of two classes. (Contributed by NM, 12-Dec-2006.)
ran (𝐴𝐵) = ran (𝐴 ↾ ran 𝐵)

Theoremrnco2 4879 The range of the composition of two classes. (Contributed by NM, 27-Mar-2008.)
ran (𝐴𝐵) = (𝐴 “ ran 𝐵)

Theoremdmco 4880 The domain of a composition. Exercise 27 of [Enderton] p. 53. (Contributed by NM, 4-Feb-2004.)
dom (𝐴𝐵) = (𝐵 “ dom 𝐴)

Theoremcoiun 4881* Composition with an indexed union. (Contributed by NM, 21-Dec-2008.)
(𝐴 𝑥𝐶 𝐵) = 𝑥𝐶 (𝐴𝐵)

Theoremcocnvcnv1 4882 A composition is not affected by a double converse of its first argument. (Contributed by NM, 8-Oct-2007.)
(𝐴𝐵) = (𝐴𝐵)

Theoremcocnvcnv2 4883 A composition is not affected by a double converse of its second argument. (Contributed by NM, 8-Oct-2007.)
(𝐴𝐵) = (𝐴𝐵)

Theoremcores2 4884 Absorption of a reverse (preimage) restriction of the second member of a class composition. (Contributed by NM, 11-Dec-2006.)
(dom 𝐴𝐶 → (𝐴(𝐵𝐶)) = (𝐴𝐵))

Theoremco02 4885 Composition with the empty set. Theorem 20 of [Suppes] p. 63. (Contributed by NM, 24-Apr-2004.)
(𝐴 ∘ ∅) = ∅

Theoremco01 4886 Composition with the empty set. (Contributed by NM, 24-Apr-2004.)
(∅ ∘ 𝐴) = ∅

Theoremcoi1 4887 Composition with the identity relation. Part of Theorem 3.7(i) of [Monk1] p. 36. (Contributed by NM, 22-Apr-2004.)
(Rel 𝐴 → (𝐴 ∘ I ) = 𝐴)

Theoremcoi2 4888 Composition with the identity relation. Part of Theorem 3.7(i) of [Monk1] p. 36. (Contributed by NM, 22-Apr-2004.)
(Rel 𝐴 → ( I ∘ 𝐴) = 𝐴)

Theoremcoires1 4889 Composition with a restricted identity relation. (Contributed by FL, 19-Jun-2011.) (Revised by Stefan O'Rear, 7-Mar-2015.)
(𝐴 ∘ ( I ↾ 𝐵)) = (𝐴𝐵)

Theoremcoass 4890 Associative law for class composition. Theorem 27 of [Suppes] p. 64. Also Exercise 21 of [Enderton] p. 53. Interestingly, this law holds for any classes whatsoever, not just functions or even relations. (Contributed by NM, 27-Jan-1997.)
((𝐴𝐵) ∘ 𝐶) = (𝐴 ∘ (𝐵𝐶))

Theoremrelcnvtr 4891 A relation is transitive iff its converse is transitive. (Contributed by FL, 19-Sep-2011.)
(Rel 𝑅 → ((𝑅𝑅) ⊆ 𝑅 ↔ (𝑅𝑅) ⊆ 𝑅))

Theoremrelssdmrn 4892 A relation is included in the cross product of its domain and range. Exercise 4.12(t) of [Mendelson] p. 235. (Contributed by NM, 3-Aug-1994.)
(Rel 𝐴𝐴 ⊆ (dom 𝐴 × ran 𝐴))

Theoremcnvssrndm 4893 The converse is a subset of the cartesian product of range and domain. (Contributed by Mario Carneiro, 2-Jan-2017.)
𝐴 ⊆ (ran 𝐴 × dom 𝐴)

Theoremcossxp 4894 Composition as a subset of the cross product of factors. (Contributed by Mario Carneiro, 12-Jan-2017.)
(𝐴𝐵) ⊆ (dom 𝐵 × ran 𝐴)

Theoremrelrelss 4895 Two ways to describe the structure of a two-place operation. (Contributed by NM, 17-Dec-2008.)
((Rel 𝐴 ∧ Rel dom 𝐴) ↔ 𝐴 ⊆ ((V × V) × V))

Theoremunielrel 4896 The membership relation for a relation is inherited by class union. (Contributed by NM, 17-Sep-2006.)
((Rel 𝑅𝐴𝑅) → 𝐴 𝑅)

Theoremrelfld 4897 The double union of a relation is its field. (Contributed by NM, 17-Sep-2006.)
(Rel 𝑅 𝑅 = (dom 𝑅 ∪ ran 𝑅))

Theoremrelresfld 4898 Restriction of a relation to its field. (Contributed by FL, 15-Apr-2012.)
(Rel 𝑅 → (𝑅 𝑅) = 𝑅)

Theoremrelcoi2 4899 Composition with the identity relation restricted to a relation's field. (Contributed by FL, 2-May-2011.)
(Rel 𝑅 → (( I ↾ 𝑅) ∘ 𝑅) = 𝑅)

Theoremrelcoi1 4900 Composition with the identity relation restricted to a relation's field. (Contributed by FL, 8-May-2011.)
(Rel 𝑅 → (𝑅 ∘ ( I ↾ 𝑅)) = 𝑅)

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-11087
 Copyright terms: Public domain < Previous  Next >