Theorem bnj1098 32663

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

Step	Hyp	Ref	Expression
1		3anrev 1099	. . . . . . 7 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) ↔ (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛 ∧ 𝑖 ≠ ∅))
2		df-3an 1087	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛 ∧ 𝑖 ≠ ∅) ↔ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅))
3	1, 2	bitri 274	. . . . . 6 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) ↔ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅))
4		simpr 484	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑖 ∈ 𝑛)
5		bnj1098.1	. . . . . . . . . 10 ⊢ 𝐷 = (ω ∖ {∅})
6	5	bnj923 32648	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω)
7	6	adantr 480	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑛 ∈ ω)
8		elnn 7698	. . . . . . . 8 ⊢ ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑖 ∈ ω)
9	4, 7, 8	syl2anc 583	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑖 ∈ ω)
10	9	anim1i 614	. . . . . 6 ⊢ (((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
11	3, 10	sylbi 216	. . . . 5 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
12		nnsuc 7705	. . . . 5 ⊢ ((𝑖 ∈ ω ∧ 𝑖 ≠ ∅) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
13	11, 12	syl 17	. . . 4 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
14		df-rex 3069	. . . . . 6 ⊢ (∃𝑗 ∈ ω 𝑖 = suc 𝑗 ↔ ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
15	14	imbi2i 335	. . . . 5 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
16		19.37v 1996	. . . . 5 ⊢ (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
17	15, 16	bitr4i 277	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
18	13, 17	mpbi 229	. . 3 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
19		ancr 546	. . 3 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷))))
20	18, 19	bnj101 32602	. 2 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)))
21		vex 3426	. . . . . 6 ⊢ 𝑗 ∈ V
22	21	bnj216 32611	. . . . 5 ⊢ (𝑖 = suc 𝑗 → 𝑗 ∈ 𝑖)
23	22	ad2antlr 723	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑗 ∈ 𝑖)
24		simpr2 1193	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑖 ∈ 𝑛)
25		3simpc 1148	. . . . . . 7 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷))
26	25	ancomd 461	. . . . . 6 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛))
27	26	adantl 481	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛))
28		nnord 7695	. . . . 5 ⊢ (𝑛 ∈ ω → Ord 𝑛)
29		ordtr1 6294	. . . . 5 ⊢ (Ord 𝑛 → ((𝑗 ∈ 𝑖 ∧ 𝑖 ∈ 𝑛) → 𝑗 ∈ 𝑛))
30	27, 7, 28, 29	4syl 19	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → ((𝑗 ∈ 𝑖 ∧ 𝑖 ∈ 𝑛) → 𝑗 ∈ 𝑛))
31	23, 24, 30	mp2and 695	. . 3 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑗 ∈ 𝑛)
32		simplr 765	. . 3 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑖 = suc 𝑗)
33	31, 32	jca 511	. 2 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))
34	20, 33	bnj1023 32660	1 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539  ∃wex 1783   ∈ wcel 2108   ≠ wne 2942  ∃wrex 3064   ∖ cdif 3880  ∅c0 4253  {csn 4558  Ord word 6250  suc csuc 6253  ωcom 7687

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-om 7688

This theorem is referenced by:  bnj1110  32862  bnj1128  32870  bnj1145  32873