Theorem ordgt0ge1 6602

Description: Two ways to express that an ordinal class is positive. (Contributed by NM, 21-Dec-2004.)

Assertion

Ref	Expression
ordgt0ge1	⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴))

Proof of Theorem ordgt0ge1

Step	Hyp	Ref	Expression
1		0elon 4489	. . 3 ⊢ ∅ ∈ On
2		ordelsuc 4603	. . 3 ⊢ ((∅ ∈ On ∧ Ord 𝐴) → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
3	1, 2	mpan 424	. 2 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ suc ∅ ⊆ 𝐴))
4		df-1o 6581	. . 3 ⊢ 1o = suc ∅
5	4	sseq1i 3253	. 2 ⊢ (1o ⊆ 𝐴 ↔ suc ∅ ⊆ 𝐴)
6	3, 5	bitr4di 198	1 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 1o ⊆ 𝐴))

Syntax hints:   → wi 4   ↔ wb 105   ∈ wcel 2202   ⊆ wss 3200  ∅c0 3494  Ord word 4459  Oncon0 4460  suc csuc 4462  1_oc1o 6574

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-nul 4215

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-uni 3894  df-tr 4188  df-iord 4463  df-on 4465  df-suc 4468  df-1o 6581

This theorem is referenced by:  ordge1n0im  6603  archnqq  7636