Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1098 Structured version   Visualization version   GIF version

Theorem bnj1098 34795
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj1098.1 𝐷 = (ω ∖ {∅})
Assertion
Ref Expression
bnj1098 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗𝑛𝑖 = suc 𝑗))
Distinct variable groups:   𝐷,𝑗   𝑖,𝑗   𝑗,𝑛
Allowed substitution hints:   𝐷(𝑖,𝑛)

Proof of Theorem bnj1098
StepHypRef Expression
1 3anrev 1100 . . . . . . 7 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) ↔ (𝑛𝐷𝑖𝑛𝑖 ≠ ∅))
2 df-3an 1088 . . . . . . 7 ((𝑛𝐷𝑖𝑛𝑖 ≠ ∅) ↔ ((𝑛𝐷𝑖𝑛) ∧ 𝑖 ≠ ∅))
31, 2bitri 275 . . . . . 6 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) ↔ ((𝑛𝐷𝑖𝑛) ∧ 𝑖 ≠ ∅))
4 simpr 484 . . . . . . . 8 ((𝑛𝐷𝑖𝑛) → 𝑖𝑛)
5 bnj1098.1 . . . . . . . . . 10 𝐷 = (ω ∖ {∅})
65bnj923 34780 . . . . . . . . 9 (𝑛𝐷𝑛 ∈ ω)
76adantr 480 . . . . . . . 8 ((𝑛𝐷𝑖𝑛) → 𝑛 ∈ ω)
8 elnn 7807 . . . . . . . 8 ((𝑖𝑛𝑛 ∈ ω) → 𝑖 ∈ ω)
94, 7, 8syl2anc 584 . . . . . . 7 ((𝑛𝐷𝑖𝑛) → 𝑖 ∈ ω)
109anim1i 615 . . . . . 6 (((𝑛𝐷𝑖𝑛) ∧ 𝑖 ≠ ∅) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
113, 10sylbi 217 . . . . 5 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
12 nnsuc 7814 . . . . 5 ((𝑖 ∈ ω ∧ 𝑖 ≠ ∅) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
1311, 12syl 17 . . . 4 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
14 df-rex 3057 . . . . . 6 (∃𝑗 ∈ ω 𝑖 = suc 𝑗 ↔ ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
1514imbi2i 336 . . . . 5 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
16 19.37v 1998 . . . . 5 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
1715, 16bitr4i 278 . . . 4 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
1813, 17mpbi 230 . . 3 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
19 ancr 546 . . 3 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷))))
2018, 19bnj101 34735 . 2 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)))
21 vex 3440 . . . . . 6 𝑗 ∈ V
2221bnj216 34744 . . . . 5 (𝑖 = suc 𝑗𝑗𝑖)
2322ad2antlr 727 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑗𝑖)
24 simpr2 1196 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑖𝑛)
25 3simpc 1150 . . . . . . 7 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑖𝑛𝑛𝐷))
2625ancomd 461 . . . . . 6 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑛𝐷𝑖𝑛))
2726adantl 481 . . . . 5 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → (𝑛𝐷𝑖𝑛))
28 nnord 7804 . . . . 5 (𝑛 ∈ ω → Ord 𝑛)
29 ordtr1 6350 . . . . 5 (Ord 𝑛 → ((𝑗𝑖𝑖𝑛) → 𝑗𝑛))
3027, 7, 28, 294syl 19 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → ((𝑗𝑖𝑖𝑛) → 𝑗𝑛))
3123, 24, 30mp2and 699 . . 3 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑗𝑛)
32 simplr 768 . . 3 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑖 = suc 𝑗)
3331, 32jca 511 . 2 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → (𝑗𝑛𝑖 = suc 𝑗))
3420, 33bnj1023 34792 1 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗𝑛𝑖 = suc 𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wex 1780  wcel 2111  wne 2928  wrex 3056  cdif 3894  c0 4280  {csn 4573  Ord word 6305  suc csuc 6308  ωcom 7796
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 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-tr 5197  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-om 7797
This theorem is referenced by:  bnj1110  34994  bnj1128  35002  bnj1145  35005
  Copyright terms: Public domain W3C validator