Proof: Number of Subsets using Induction | Set Theory

We prove that a set A with n elements has 2^n subsets. Thus, we're also proving that the cardinality of a power set is 2 to the power of the cardinality of the set we're taking the power set of. If |A|=n then |P(A)|=2^n. We prove this using mathematical induction. Give it a try yourself - this is a great basic example of an induction proof! #SetTheory

Power Sets:    • What is a Power Set? | Set Theory, Su...  
Formula for Cardinality of Power Sets:    • Formula for Cardinality of Power Sets...  
How many Proper Subsets does a Set Have?    • How Many Proper Subsets Does a Set Ha...  
Finding Number of Subsets of a Set:    • Finding the Number of Subsets of a Se...  

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits:   / wrathofmathlessons  
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

Thanks to Robert Rennie, Barbara Sharrock, and Rolf Waefler for their generous support on Patreon!

Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: https://crayonangel.bandcamp.com/

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

My Music Channel:    / @emery3050