in Set Theory & Algebra edited by
159 views
0 votes
0 votes
Show that if $A$ and $B$ are sets and $A \subset B$ then $\mid A \mid \leq \mid B\mid.$
in Set Theory & Algebra edited by
by
159 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true