ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elong GIF version

Theorem elong 4370
Description: An ordinal number is an ordinal set. (Contributed by NM, 5-Jun-1994.)
Assertion
Ref Expression
elong (𝐴𝑉 → (𝐴 ∈ On ↔ Ord 𝐴))

Proof of Theorem elong
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ordeq 4369 . 2 (𝑥 = 𝐴 → (Ord 𝑥 ↔ Ord 𝐴))
2 df-on 4365 . 2 On = {𝑥 ∣ Ord 𝑥}
31, 2elab2g 2884 1 (𝐴𝑉 → (𝐴 ∈ On ↔ Ord 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wcel 2148  Ord word 4359  Oncon0 4360
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-in 3135  df-ss 3142  df-uni 3808  df-tr 4099  df-iord 4363  df-on 4365
This theorem is referenced by:  elon  4371  eloni  4372  elon2  4373  ordelon  4380  onin  4383  limelon  4396  ssonuni  4484  onsuc  4497  onsucb  4499  onintonm  4513  onprc  4548  omelon2  4604  bj-nnelon  14360
  Copyright terms: Public domain W3C validator