Theorem bnj1098 35280

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 1118	. . . . . . 7 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) ↔ (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛 ∧ 𝑖 ≠ ∅))
2		df-3an 1105	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛 ∧ 𝑖 ≠ ∅) ↔ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅))
3	1, 2	bitri 278	. . . . . 6 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) ↔ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅))
4		simpr 490	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑖 ∈ 𝑛)
5		bnj1098.1	. . . . . . . . . 10 ⊢ 𝐷 = (ω ∖ {∅})
6	5	bnj923 35265	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω)
7	6	adantr 486	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑛 ∈ ω)
8		elnn 7876	. . . . . . . 8 ⊢ ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑖 ∈ ω)
9	4, 7, 8	syl2anc 596	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → 𝑖 ∈ ω)
10	9	anim1i 627	. . . . . 6 ⊢ (((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑖 ≠ ∅) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
11	3, 10	sylbi 220	. . . . 5 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑖 ∈ ω ∧ 𝑖 ≠ ∅))
12		nnsuc 7883	. . . . 5 ⊢ ((𝑖 ∈ ω ∧ 𝑖 ≠ ∅) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
13	11, 12	syl 18	. . . 4 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗)
14		df-rex 3089	. . . . . 6 ⊢ (∃𝑗 ∈ ω 𝑖 = suc 𝑗 ↔ ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
15	14	imbi2i 339	. . . . 5 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
16		19.37v 2030	. . . . 5 ⊢ (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) ↔ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗(𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
17	15, 16	bitr4i 281	. . . 4 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ∃𝑗 ∈ ω 𝑖 = suc 𝑗) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)))
18	13, 17	mpbi 233	. . 3 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗))
19		ancr 556	. . 3 ⊢ (((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ ω ∧ 𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷))))
20	18, 19	bnj101 35220	. 2 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → ((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)))
21		vex 3457	. . . . . 6 ⊢ 𝑗 ∈ V
22	21	bnj216 35229	. . . . 5 ⊢ (𝑖 = suc 𝑗 → 𝑗 ∈ 𝑖)
23	22	ad2antlr 740	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑗 ∈ 𝑖)
24		simpr2 1214	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑖 ∈ 𝑛)
25		3simpc 1168	. . . . . . 7 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷))
26	25	ancomd 467	. . . . . 6 ⊢ ((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛))
27	26	adantl 487	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → (𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛))
28		nnord 7873	. . . . 5 ⊢ (𝑛 ∈ ω → Ord 𝑛)
29		ordtr1 6406	. . . . 5 ⊢ (Ord 𝑛 → ((𝑗 ∈ 𝑖 ∧ 𝑖 ∈ 𝑛) → 𝑗 ∈ 𝑛))
30	27, 7, 28, 29	4syl 20	. . . 4 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → ((𝑗 ∈ 𝑖 ∧ 𝑖 ∈ 𝑛) → 𝑗 ∈ 𝑛))
31	23, 24, 30	mp2and 712	. . 3 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑗 ∈ 𝑛)
32		simplr 781	. . 3 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → 𝑖 = suc 𝑗)
33	31, 32	jca 521	. 2 ⊢ (((𝑗 ∈ ω ∧ 𝑖 = suc 𝑗) ∧ (𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷)) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))
34	20, 33	bnj1023 35277	1 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷) → (𝑗 ∈ 𝑛 ∧ 𝑖 = suc 𝑗))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2957  ∃wrex 3088   ∖ cdif 3899  ∅c0 4282  {csn 4587  Ord word 6360  suc csuc 6363  ωcom 7865

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-om 7866

This theorem is used by:  bnj1110  35478  bnj1128  35486  bnj1145  35489