The relationship between logical implication and the subset relation
From Maths
This page is a dire page and is in desperate need of an update.
Definition
A⊆B (and we say "A is a subset of B") if and only if every element of A also belongs to B
That is: [A⊆B]⟺∀x[x∈A⟹x∈B][1]
Note: 16/1/2017 by Alec (talk) 17:36, 16 January 2017 (UTC)
We may often write:
- ∀x∈A[x∈B] instead.
This is easily seen to be equivalent as if A is empty (so there is no x∈A to speak of) the implication is semantically true, and the forall is vacuously true.
References
- Jump up ↑ Definition 3.10 (p10) - Introduction to Set Theory, Third Edition (Revised and Expanded) - Karel Hrbacek and Thomas Jech