Theorem ondif2 8378

Description: Two ways to say that 𝐴 is an ordinal greater than one. (Contributed by Mario Carneiro, 21-May-2015.)

Assertion

Ref	Expression
ondif2	⊢ (𝐴 ∈ (On ∖ 2o) ↔ (𝐴 ∈ On ∧ 1o ∈ 𝐴))

Proof of Theorem ondif2

Step	Hyp	Ref	Expression
1		eldif 3906	. 2 ⊢ (𝐴 ∈ (On ∖ 2o) ↔ (𝐴 ∈ On ∧ ¬ 𝐴 ∈ 2o))
2		1on 8354	. . . . 5 ⊢ 1o ∈ On
3		ontri1 6320	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On) → (𝐴 ⊆ 1o ↔ ¬ 1o ∈ 𝐴))
4		onsssuc 6375	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On) → (𝐴 ⊆ 1o ↔ 𝐴 ∈ suc 1o))
5		df-2o 8343	. . . . . . . 8 ⊢ 2o = suc 1o
6	5	eleq2i 2829	. . . . . . 7 ⊢ (𝐴 ∈ 2o ↔ 𝐴 ∈ suc 1o)
7	4, 6	bitr4di 288	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On) → (𝐴 ⊆ 1o ↔ 𝐴 ∈ 2o))
8	3, 7	bitr3d 280	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 1o ∈ On) → (¬ 1o ∈ 𝐴 ↔ 𝐴 ∈ 2o))
9	2, 8	mpan2 688	. . . 4 ⊢ (𝐴 ∈ On → (¬ 1o ∈ 𝐴 ↔ 𝐴 ∈ 2o))
10	9	con1bid 355	. . 3 ⊢ (𝐴 ∈ On → (¬ 𝐴 ∈ 2o ↔ 1o ∈ 𝐴))
11	10	pm5.32i 575	. 2 ⊢ ((𝐴 ∈ On ∧ ¬ 𝐴 ∈ 2o) ↔ (𝐴 ∈ On ∧ 1o ∈ 𝐴))
12	1, 11	bitri 274	1 ⊢ (𝐴 ∈ (On ∖ 2o) ↔ (𝐴 ∈ On ∧ 1o ∈ 𝐴))

Syntax hints:  ¬ wn 3   ↔ wb 205   ∧ wa 396   ∈ wcel 2105   ∖ cdif 3893   ⊆ wss 3896  Oncon0 6286  suc csuc 6288  1_oc1o 8335  2_oc2o 8336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2708  ax-sep 5236  ax-nul 5243  ax-pr 5365

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-sb 2067  df-clab 2715  df-cleq 2729  df-clel 2815  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3443  df-dif 3899  df-un 3901  df-in 3903  df-ss 3913  df-pss 3915  df-nul 4267  df-if 4470  df-pw 4545  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4849  df-br 5086  df-opab 5148  df-tr 5203  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5560  df-we 5562  df-ord 6289  df-on 6290  df-suc 6292  df-1o 8342  df-2o 8343

This theorem is referenced by:  dif20el  8381  oeordi  8464  oewordi  8468  oaabs2  8525  omabs  8527  cnfcom3clem  9531  infxpenc2lem1  9845