Theorem el2oss1o 6676

Description: Being an element of ordinal two implies being a subset of ordinal one. The converse is equivalent to excluded middle by ss1oel2o 16761. (Contributed by Jim Kingdon, 8-Aug-2022.)

Assertion

Ref	Expression
el2oss1o	⊢ (𝐴 ∈ 2o → 𝐴 ⊆ 1o)

Proof of Theorem el2oss1o

Step	Hyp	Ref	Expression
1		elpri 3712	. . 3 ⊢ (𝐴 ∈ {∅, 1o} → (𝐴 = ∅ ∨ 𝐴 = 1o))
2		df2o3 6662	. . 3 ⊢ 2o = {∅, 1o}
3	1, 2	eleq2s 2327	. 2 ⊢ (𝐴 ∈ 2o → (𝐴 = ∅ ∨ 𝐴 = 1o))
4		0ss 3547	. . . 4 ⊢ ∅ ⊆ 1o
5		sseq1 3261	. . . 4 ⊢ (𝐴 = ∅ → (𝐴 ⊆ 1o ↔ ∅ ⊆ 1o))
6	4, 5	mpbiri 168	. . 3 ⊢ (𝐴 = ∅ → 𝐴 ⊆ 1o)
7		eqimss 3292	. . 3 ⊢ (𝐴 = 1o → 𝐴 ⊆ 1o)
8	6, 7	jaoi 724	. 2 ⊢ ((𝐴 = ∅ ∨ 𝐴 = 1o) → 𝐴 ⊆ 1o)
9	3, 8	syl 14	1 ⊢ (𝐴 ∈ 2o → 𝐴 ⊆ 1o)

Syntax hints:   → wi 4   ∨ wo 716   = wceq 1398   ∈ wcel 2203   ⊆ wss 3211  ∅c0 3508  {cpr 3690  1_oc1o 6640  2_oc2o 6641

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-sn 3695  df-pr 3696  df-suc 4492  df-1o 6647  df-2o 6648

This theorem is referenced by:  nnnninfeq2  7420  nninfwlpoimlemg  7466  nninfsellemsuc  16790