Theorem onssnel2i 6474

Description: An ordering law for ordinal numbers. (Contributed by NM, 13-Jun-1994.)

Hypothesis

Ref	Expression
on.1	⊢ 𝐴 ∈ On

Assertion

Ref	Expression
onssnel2i	⊢ (𝐵 ⊆ 𝐴 → ¬ 𝐴 ∈ 𝐵)

Proof of Theorem onssnel2i

Step	Hyp	Ref	Expression
1		on.1	. . 3 ⊢ 𝐴 ∈ On
2	1	onirri 6470	. 2 ⊢ ¬ 𝐴 ∈ 𝐴
3		ssel 3925	. 2 ⊢ (𝐵 ⊆ 𝐴 → (𝐴 ∈ 𝐵 → 𝐴 ∈ 𝐴))
4	2, 3	mtoi 202	1 ⊢ (𝐵 ⊆ 𝐴 → ¬ 𝐴 ∈ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∈ wcel 2145   ⊆ wss 3899  Oncon0 6355

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6358  df-on 6359

This theorem is used by: (None)