Theorem onsseli 6433

Description: Subset is equivalent to membership or equality for ordinal numbers. (Contributed by NM, 15-Sep-1995.)

Hypotheses

Ref	Expression
on.1	⊢ 𝐴 ∈ On
on.2	⊢ 𝐵 ∈ On

Assertion

Ref	Expression
onsseli	⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))

Proof of Theorem onsseli

Step	Hyp	Ref	Expression
1		on.1	. 2 ⊢ 𝐴 ∈ On
2		on.2	. 2 ⊢ 𝐵 ∈ On
3		onsseleq 6352	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
4	1, 2, 3	mp2an 698	1 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))

Syntax hints:   ↔ wb 207   ∨ wo 853   = wceq 1547   ∈ wcel 2119   ⊆ wss 3883  Oncon0 6311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5219  ax-pr 5363

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-br 5074  df-opab 5136  df-tr 5181  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-ord 6314  df-on 6315

This theorem is referenced by:  cardom  9902  tskcard  10696  onnolt  28277  bdayfinbndlem1  28478