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 32772
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 274 . . . . . 6 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) ↔ ((𝑛𝐷𝑖𝑛) ∧ 𝑖 ≠ ∅))
4 simpr 485 . . . . . . . 8 ((𝑛𝐷𝑖𝑛) → 𝑖𝑛)
5 bnj1098.1 . . . . . . . . . 10 𝐷 = (ω ∖ {∅})
65bnj923 32757 . . . . . . . . 9 (𝑛𝐷𝑛 ∈ ω)
76adantr 481 . . . . . . . 8 ((𝑛𝐷𝑖𝑛) → 𝑛 ∈ ω)
8 elnn 7732 . . . . . . . 8 ((𝑖𝑛𝑛 ∈ ω) → 𝑖 ∈ ω)
94, 7, 8syl2anc 584 . . . . . . 7 ((𝑛𝐷𝑖𝑛) → 𝑖 ∈ ω)
109anim1i 615 . . . . . 6 (((𝑛𝐷𝑖𝑛) ∧ 𝑖 ≠ ∅) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
113, 10sylbi 216 . . . . 5 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
12 nnsuc 7739 . . . . 5 ((𝑖 ∈ ω ∧ 𝑖 ≠ ∅) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
1311, 12syl 17 . . . 4 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
14 df-rex 3071 . . . . . 6 (∃𝑗 ∈ ω 𝑖 = suc 𝑗 ↔ ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
1514imbi2i 336 . . . . 5 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
16 19.37v 1996 . . . . 5 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
1715, 16bitr4i 277 . . . 4 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
1813, 17mpbi 229 . . 3 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
19 ancr 547 . . 3 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷))))
2018, 19bnj101 32711 . 2 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)))
21 vex 3437 . . . . . 6 𝑗 ∈ V
2221bnj216 32720 . . . . 5 (𝑖 = suc 𝑗𝑗𝑖)
2322ad2antlr 724 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑗𝑖)
24 simpr2 1194 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑖𝑛)
25 3simpc 1149 . . . . . . 7 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑖𝑛𝑛𝐷))
2625ancomd 462 . . . . . 6 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑛𝐷𝑖𝑛))
2726adantl 482 . . . . 5 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → (𝑛𝐷𝑖𝑛))
28 nnord 7729 . . . . 5 (𝑛 ∈ ω → Ord 𝑛)
29 ordtr1 6313 . . . . 5 (Ord 𝑛 → ((𝑗𝑖𝑖𝑛) → 𝑗𝑛))
3027, 7, 28, 294syl 19 . . . 4 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → ((𝑗𝑖𝑖𝑛) → 𝑗𝑛))
3123, 24, 30mp2and 696 . . 3 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑗𝑛)
32 simplr 766 . . 3 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → 𝑖 = suc 𝑗)
3331, 32jca 512 . 2 (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷)) → (𝑗𝑛𝑖 = suc 𝑗))
3420, 33bnj1023 32769 1 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗𝑛𝑖 = suc 𝑗))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1539  wex 1782  wcel 2107  wne 2944  wrex 3066  cdif 3885  c0 4257  {csn 4562  Ord word 6269  suc csuc 6272  ωcom 7721
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-11 2155  ax-ext 2710  ax-sep 5224  ax-nul 5231  ax-pr 5353  ax-un 7597
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2069  df-clab 2717  df-cleq 2731  df-clel 2817  df-ne 2945  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3435  df-dif 3891  df-un 3893  df-in 3895  df-ss 3905  df-pss 3907  df-nul 4258  df-if 4461  df-pw 4536  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4841  df-br 5076  df-opab 5138  df-tr 5193  df-eprel 5496  df-po 5504  df-so 5505  df-fr 5545  df-we 5547  df-ord 6273  df-on 6274  df-lim 6275  df-suc 6276  df-om 7722
This theorem is referenced by:  bnj1110  32971  bnj1128  32979  bnj1145  32982
  Copyright terms: Public domain W3C validator