HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: 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-5787

Color key:    Metamath Proof
Explorer  Metamath Proof Explorer (1-4957)   Hilbert Space Explorer  Hilbert Space Explorer (4958-5787)  

Statement List for Metamath Proof Explorer - 1501-1600 - Page 16 of 58
TypeLabelDescription
Statement
 
Theoremhbss 1501 If x is not free in A and B, it is not free in A (_ B.
|- (y e. A -> A.x y e. A)   &   |- (y e. B -> A.x y e. B)   =>   |- (A (_ B -> A.x A (_ B)
 
Theoremssel 1502 Membership relationships follow from a subclass relationship.
|- (A (_ B -> (C e. A -> C e. B))
 
Theoremssel2 1503 Membership relationships follow from a subclass relationship.
|- ((A (_ B /\ C e. A) -> C e. B)
 
Theoremsseli 1504 Membership inference from subclass relationship.
|- A (_ B   =>   |- (C e. A -> C e. B)
 
Theoremsselii 1505 Membership inference from subclass relationship.
|- A (_ B   &   |- C e. A   =>   |- C e. B
 
Theoremsseld 1506 Membership deduction from subclass relationship.
|- (ph -> A (_ B)   =>   |- (ph -> (C e. A -> C e. B))
 
Theoremsseldd 1507 Membership inference from subclass relationship.
|- (ph -> A (_ B)   &   |- (ph -> C e. A)   =>   |- (ph -> C e. B)
 
Theoremssriv 1508 Inference rule based on subclass definition.
|- (x e. A -> x e. B)   =>   |- A (_ B
 
Theoremssrdv 1509 Deduction rule based on subclass definition.
|- (ph -> (x e. A -> x e. B))   =>   |- (ph -> A (_ B)
 
Theoremsstr2 1510 Transitivity of subclasses. Exercise 5 of [TakeutiZaring] p. 17.
|- (A (_ B -> (B (_ C -> A (_ C))
 
Theoremsstr 1511 Transitivity of subclasses. Theorem 6 of [Suppes] p. 23.
|- ((A (_ B /\ B (_ C) -> A (_ C)
 
Theoremsstri 1512 Subclass transitivity inference.
|- A (_ B   &   |- B (_ C   =>   |- A (_ C
 
Theoremsstrd 1513 Subclass transitivity deduction.
|- (ph -> A (_ B)   &   |- (ph -> B (_ C)   =>   |- (ph -> A (_ C)
 
Theoremsylan9ss 1514 A subclass transitivity deduction.
|- (ph -> A (_ B)   &   |- (ps -> B (_ C)   =>   |- ((ph /\ ps) -> A (_ C)
 
Theoremsylan9ssr 1515 A subclass transitivity deduction.
|- (ph -> A (_ B)   &   |- (ps -> B (_ C)   =>   |- ((ps /\ ph) -> A (_ C)
 
Theoremeqss 1516 The subclass relationship is antisymmetric. Compare Theorem 4 of [Suppes] p. 22.
|- (A = B <-> (A (_ B /\ B (_ A))
 
Theoremeqssi 1517 Infer equality from two subclass relationships. Compare Theorem 4 of [Suppes] p. 22.
|- A (_ B   &   |- B (_ A   =>   |- A = B
 
Theoremeqssd 1518 Equality deduction from two subclass relationships. Compare Theorem 4 of [Suppes] p. 22.
|- (ph -> A (_ B)   &   |- (ph -> B (_ A)   =>   |- (ph -> A = B)
 
Theoremssid 1519 Any class is a subclass of itself. Exercise 10 of [TakeutiZaring] p. 18.
|- A (_ A
 
Theoremssv 1520 Any class is a subclass of the universal class.
|- A (_ V
 
Theoremsseq1 1521 Equality theorem for subclasses.
|- (A = B -> (A (_ C <-> B (_ C))
 
Theoremsseq2 1522 Equality theorem for the subclass relationship.
|- (A = B -> (C (_ A <-> C (_ B))
 
Theoremsseq12 1523 Equality theorem for the subclass relationship.
|- ((A = B /\ C = D) -> (A (_ C <-> B (_ D))
 
Theoremsseq1i 1524 An equality inference for the subclass relationship.
|- A = B   =>   |- (A (_ C <-> B (_ C)
 
Theoremsseq2i 1525 An equality inference for the subclass relationship.
|- A = B   =>   |- (C (_ A <-> C (_ B)
 
Theoremsseq12i 1526 An equality inference for the subclass relationship.
|- A = B   &   |- C = D   =>   |- (A (_ C <-> B (_ D)
 
Theoremsseq1d 1527 An equality deduction for the subclass relationship.
|- (ph -> A = B)   =>   |- (ph -> (A (_ C <-> B (_ C))
 
Theoremsseq2d 1528 An equality deduction for the subclass relationship.
|- (ph -> A = B)   =>   |- (ph -> (C (_ A <-> C (_ B))
 
Theoremsseq12d 1529 An equality deduction for the subclass relationship.
|- (ph -> A = B)   &   |- (ph -> C = D)   =>   |- (ph -> (A (_ C <-> B (_ D))
 
Theoremeqsstr 1530 Substitution of equality into a subclass relationship.
|- A = B   &   |- B (_ C   =>   |- A (_ C
 
Theoremeqsstr3 1531 Substitution of equality into a subclass relationship.
|- B = A   &   |- B (_ C   =>   |- A (_ C
 
Theoremsseqtr 1532 Substitution of equality into a subclass relationship.
|- A (_ B   &   |- B = C   =>   |- A (_ C
 
Theoremsseqtr4 1533 Substitution of equality into a subclass relationship.
|- A (_ B   &   |- C = B   =>   |- A (_ C
 
Theoremeqsstrd 1534 Substitution of equality into a subclass relationship.
|- (ph -> A = B)   &   |- (ph -> B (_ C)   =>   |- (ph -> A (_ C)
 
Theoremeqsstr3d 1535 Substitution of equality into a subclass relationship.
|- (ph -> B = A)   &   |- (ph -> B (_ C)   =>   |- (ph -> A (_ C)
 
Theoremsseqtrd 1536 Substitution of equality into a subclass relationship.
|- (ph -> A (_ B)   &   |- (ph -> B = C)   =>   |- (ph -> A (_ C)
 
Theoremsseqtr4d 1537 Substitution of equality into a subclass relationship.
|- (ph -> A (_ B)   &   |- (ph -> C = B)   =>   |- (ph -> A (_ C)
 
Theorem3sstr3 1538 Substitution of equality in both sides of a subclass relationship.
|- A (_ B   &   |- A = C   &   |- B = D   =>   |- C (_ D
 
Theorem3sstr4 1539 Substitution of equality in both sides of a subclass relationship.
|- A (_ B   &   |- C = A   &   |- D = B   =>   |- C (_ D
 
Theorem3sstr3g 1540 Substitution of equality into both sides of a subclass relationship.
|- (ph -> A (_ B)   &   |- A = C   &   |- B = D   =>   |- (ph -> C (_ D)
 
Theorem3sstr4g 1541 Substitution of equality into both sides of a subclass relationship.
|- (ph -> A (_ B)   &   |- C = A   &   |- D = B   =>   |- (ph -> C (_ D)
 
Theorem3sstr3d 1542 Substitution of equality into both sides of a subclass relationship.
|- (ph -> A (_ B)   &   |- (ph -> A = C)   &   |- (ph -> B = D)   =>   |- (ph -> C (_ D)
 
Theorem3sstr4d 1543 Substitution of equality into both sides of a subclass relationship.
|- (ph -> A (_ B)   &   |- (ph -> C = A)   &   |- (ph -> D = B)   =>   |- (ph -> C (_ D)
 
Theoremsyl5ss 1544 A chained subclass and equality deduction.
|- (ph -> A (_ B)   &   |- C = A   =>   |- (ph -> C (_ B)
 
Theoremsyl5ssr 1545 A chained subclass and equality deduction.
|- (ph -> A (_ B)   &   |- A = C   =>   |- (ph -> C (_ B)
 
Theoremsyl6ss 1546 A chained subclass and equality deduction.
|- (ph -> A (_ B)   &   |- B = C   =>   |- (ph -> A (_ C)
 
Theoremsyl6ssr 1547 A chained subclass and equality deduction.
|- (ph -> A (_ B)   &   |- C = B   =>   |- (ph -> A (_ C)
 
Theoremeqimss 1548 Equality implies the subclass relation.
|- (A = B -> A (_ B)
 
Theoremeqimss2 1549 Equality implies the subclass relation.
|- (B = A -> A (_ B)
 
Theoremnss 1550 Negation of subclass relationship. Exercise 13 of [TakeutiZaring] p. 18.
|- (-. A (_ B <-> E.x(x e. A /\ -. x e. B))
 
Theoremss2ab 1551 Equivalence of abstraction subclass and implication.
|- ({x | ph} (_ {x | ps} <-> A.x(ph -> ps))
 
Theoremss2abi 1552 Inference of abstraction subclass from implication.
|- (ph -> ps)   =>   |- {x | ph} (_ {x | ps}
 
Theoremss2rab 1553 Equivalence of restricted abstraction subclass and implication.
|- ({x e. A | ph} (_ {x e. A | ps} <-> A.x e. A (ph -> ps))
 
Theoremss2rabi 1554 Inference of restricted abstraction subclass from implication.
|- (x e. A -> (ph -> ps))   =>   |- {x e. A | ph} (_ {x e. A | ps}
 
Theoremssab 1555 Restriction of class abstraction creates subclass.
|- {x | (x e. A /\ ph)} (_ A
 
Theoremssrab 1556 Restriction of class abstraction creates subclass.
|- {x e. A | ph} (_ A
 
Theoremdfpss2 1557 Alternate definition of proper subclass.
|- (A (. B <-> (A (_ B /\ -. A = B))
 
Theoremdfpss3 1558 Alternate definition of proper subclass.
|- (A (. B <-> (A (_ B /\ -. B (_ A))
 
Theorempsseq1 1559 Equality theorem for proper subclass.
|- (A = B -> (A (. C <-> B (. C))
 
Theorempsseq2 1560 Equality theorem for proper subclass.
|- (A = B -> (C (. A <-> C (. B))
 
Theorempsseq1i 1561 An equality inference for the proper subclass relationship.
|- A = B   =>   |- (A (. C <-> B (. C)
 
Theorempsseq2i 1562 An equality inference for the proper subclass relationship.
|- A = B   =>   |- (C (. A <-> C (. B)
 
Theorempsseq12i 1563 An equality inference for the proper subclass relationship.
|- A = B   &   |- C = D   =>   |- (A (. C <-> B (. D)
 
Theorempsseq1d 1564 An equality deduction for the proper subclass relationship.
|- (ph -> A = B)   =>   |- (ph -> (A (. C <-> B (. C))
 
Theorempsseq2d 1565 An equality deduction for the proper subclass relationship.
|- (ph -> A = B)   =>   |- (ph -> (C (. A <-> C (. B))
 
Theorempsseq12d 1566 An equality deduction for the proper subclass relationship.
|- (ph -> A = B)   &   |- (ph -> C = D)   =>   |- (ph -> (A (. C <-> B (. D))
 
Theorempssss 1567 A proper subclass is a subclass. Theorem 10 of [Suppes] p. 23.
|- (A (. B -> A (_ B)
 
Theorempssssd 1568 Deduce subclass from proper subclass.
|- (ph -> A (. B)   =>   |- (ph -> A (_ B)
 
Theoremsspss 1569 Subclass in terms of proper subclass.
|- (A (_ B <-> (A (. B \/ A = B))
 
Theorempssirr 1570 Proper subclass is irreflexive. Theorem 7 of [Suppes] p. 23.
|- -. A (. A
 
Theorempssn2lp 1571 Proper subclass has no 2-cycle loops. Compare Theorem 8 of [Suppes] p. 23.
|- -. (A (. B /\ B (. A)
 
Theoremsspsstri 1572 Two ways of stating trichotomy with respect to inclusion.
|- ((A (_ B \/ B (_ A) <-> (A (. B \/ A = B \/ B (. A))
 
Theoremssnpss 1573 Partial trichotomy law for subclasses.
|- (A (_ B -> -. B (. A)
 
Theorempsstr 1574 Transitive law for proper subclass. Theorem 9 of [Suppes] p. 23.
|- ((A (. B /\ B (. C) -> A (. C)
 
Theoremsspsstr 1575 Transitive law for subclass and proper subclass.
|- ((A (_ B /\ B (. C) -> A (. C)
 
Theorempsssstr 1576 Transitive law for subclass and proper subclass.
|- ((A (. B /\ B (_ C) -> A (. C)
 
Theoremreuss 1577 Restriction of uniqueness to a smaller subclass.
|- ((A (_ B /\ (E.x e. A ph /\ E!x e. B ph)) -> E!x e. A ph)
 
Theoremreupick 1578 Restricted uniqueness "picks" a member of a subclass.
|- (((A (_ B /\ (E.x