Metamath Proof Explorer


Theorem sqfpc

Description: The prime count of a squarefree number is at most 1. (Contributed by Mario Carneiro, 1-Jul-2015)

Ref Expression
Assertion sqfpc AμA0PPpCntA1

Proof

Step Hyp Ref Expression
1 issqf AμA0pppCntA1
2 1 biimpa AμA0pppCntA1
3 oveq1 p=PppCntA=PpCntA
4 3 breq1d p=PppCntA1PpCntA1
5 4 rspccv pppCntA1PPpCntA1
6 2 5 syl AμA0PPpCntA1
7 6 3impia AμA0PPpCntA1