Metamath Proof Explorer


Theorem naddword2

Description: Weak-ordering principle for natural addition. (Contributed by Scott Fenton, 15-Feb-2025)

Ref Expression
Assertion naddword2 Could not format assertion : No typesetting found for |- ( ( A e. On /\ B e. On ) -> A C_ ( B +no A ) ) with typecode |-

Proof

Step Hyp Ref Expression
1 naddword1 Could not format ( ( A e. On /\ B e. On ) -> A C_ ( A +no B ) ) : No typesetting found for |- ( ( A e. On /\ B e. On ) -> A C_ ( A +no B ) ) with typecode |-
2 naddcom Could not format ( ( A e. On /\ B e. On ) -> ( A +no B ) = ( B +no A ) ) : No typesetting found for |- ( ( A e. On /\ B e. On ) -> ( A +no B ) = ( B +no A ) ) with typecode |-
3 1 2 sseqtrd Could not format ( ( A e. On /\ B e. On ) -> A C_ ( B +no A ) ) : No typesetting found for |- ( ( A e. On /\ B e. On ) -> A C_ ( B +no A ) ) with typecode |-