Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-nn0suc GIF version

Theorem bj-nn0suc 16860
Description: Proof of (biconditional form of) nn0suc 4731 from the core axioms of CZF. See also bj-nn0sucALT 16874. As a characterization of the elements of ω, this could be labeled "elom". (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-nn0suc (𝐴 ∈ ω ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem bj-nn0suc
StepHypRef Expression
1 bj-nn0suc0 16846 . . 3 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥𝐴 𝐴 = suc 𝑥))
2 bj-omtrans 16852 . . . . 5 (𝐴 ∈ ω → 𝐴 ⊆ ω)
3 ssrexv 3307 . . . . 5 (𝐴 ⊆ ω → (∃𝑥𝐴 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
42, 3syl 14 . . . 4 (𝐴 ∈ ω → (∃𝑥𝐴 𝐴 = suc 𝑥 → ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
54orim2d 796 . . 3 (𝐴 ∈ ω → ((𝐴 = ∅ ∨ ∃𝑥𝐴 𝐴 = suc 𝑥) → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥)))
61, 5mpd 13 . 2 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
7 peano1 4721 . . . 4 ∅ ∈ ω
8 eleq1 2297 . . . 4 (𝐴 = ∅ → (𝐴 ∈ ω ↔ ∅ ∈ ω))
97, 8mpbiri 168 . . 3 (𝐴 = ∅ → 𝐴 ∈ ω)
10 bj-peano2 16835 . . . . 5 (𝑥 ∈ ω → suc 𝑥 ∈ ω)
11 eleq1a 2306 . . . . . 6 (suc 𝑥 ∈ ω → (𝐴 = suc 𝑥𝐴 ∈ ω))
1211imp 124 . . . . 5 ((suc 𝑥 ∈ ω ∧ 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
1310, 12sylan 283 . . . 4 ((𝑥 ∈ ω ∧ 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
1413rexlimiva 2657 . . 3 (∃𝑥 ∈ ω 𝐴 = suc 𝑥𝐴 ∈ ω)
159, 14jaoi 724 . 2 ((𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥) → 𝐴 ∈ ω)
166, 15impbii 126 1 (𝐴 ∈ ω ↔ (𝐴 = ∅ ∨ ∃𝑥 ∈ ω 𝐴 = suc 𝑥))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wo 716   = wceq 1398  wcel 2205  wrex 2523  wss 3214  c0 3512  suc csuc 4491  ωcom 4717
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-13 2207  ax-14 2208  ax-ext 2216  ax-nul 4241  ax-pr 4327  ax-un 4559  ax-bd0 16709  ax-bdim 16710  ax-bdan 16711  ax-bdor 16712  ax-bdn 16713  ax-bdal 16714  ax-bdex 16715  ax-bdeq 16716  ax-bdel 16717  ax-bdsb 16718  ax-bdsep 16780  ax-infvn 16837
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-suc 4497  df-iom 4718  df-bdc 16737  df-bj-ind 16823
This theorem is referenced by:  bj-findis  16875
  Copyright terms: Public domain W3C validator