Theorem bnj563 32124

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj563.19	⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
bnj563.21	⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))

Assertion

Ref	Expression
bnj563	⊢ ((𝜂 ∧ 𝜌) → suc 𝑖 ∈ 𝑚)

Proof of Theorem bnj563

Step	Hyp	Ref	Expression
1		bnj563.19	. . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
2		bnj312 32092	. . . . 5 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ (𝑛 = suc 𝑚 ∧ 𝑚 ∈ 𝐷 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝))
3		bnj252 32083	. . . . 5 ⊢ ((𝑛 = suc 𝑚 ∧ 𝑚 ∈ 𝐷 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ (𝑛 = suc 𝑚 ∧ (𝑚 ∈ 𝐷 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)))
4	2, 3	bitri 278	. . . 4 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ (𝑛 = suc 𝑚 ∧ (𝑚 ∈ 𝐷 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)))
5	4	simplbi 501	. . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) → 𝑛 = suc 𝑚)
6	1, 5	sylbi 220	. 2 ⊢ (𝜂 → 𝑛 = suc 𝑚)
7		bnj563.21	. . . 4 ⊢ (𝜌 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
8	7	simp2bi 1143	. . 3 ⊢ (𝜌 → suc 𝑖 ∈ 𝑛)
9	7	simp3bi 1144	. . 3 ⊢ (𝜌 → 𝑚 ≠ suc 𝑖)
10	8, 9	jca 515	. 2 ⊢ (𝜌 → (suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖))
11		necom 3040	. . . 4 ⊢ (𝑚 ≠ suc 𝑖 ↔ suc 𝑖 ≠ 𝑚)
12		eleq2 2878	. . . . . 6 ⊢ (𝑛 = suc 𝑚 → (suc 𝑖 ∈ 𝑛 ↔ suc 𝑖 ∈ suc 𝑚))
13	12	biimpa 480	. . . . 5 ⊢ ((𝑛 = suc 𝑚 ∧ suc 𝑖 ∈ 𝑛) → suc 𝑖 ∈ suc 𝑚)
14		elsuci 6225	. . . . . . 7 ⊢ (suc 𝑖 ∈ suc 𝑚 → (suc 𝑖 ∈ 𝑚 ∨ suc 𝑖 = 𝑚))
15		orcom 867	. . . . . . . 8 ⊢ ((suc 𝑖 = 𝑚 ∨ suc 𝑖 ∈ 𝑚) ↔ (suc 𝑖 ∈ 𝑚 ∨ suc 𝑖 = 𝑚))
16		neor 3078	. . . . . . . 8 ⊢ ((suc 𝑖 = 𝑚 ∨ suc 𝑖 ∈ 𝑚) ↔ (suc 𝑖 ≠ 𝑚 → suc 𝑖 ∈ 𝑚))
17	15, 16	bitr3i 280	. . . . . . 7 ⊢ ((suc 𝑖 ∈ 𝑚 ∨ suc 𝑖 = 𝑚) ↔ (suc 𝑖 ≠ 𝑚 → suc 𝑖 ∈ 𝑚))
18	14, 17	sylib 221	. . . . . 6 ⊢ (suc 𝑖 ∈ suc 𝑚 → (suc 𝑖 ≠ 𝑚 → suc 𝑖 ∈ 𝑚))
19	18	imp 410	. . . . 5 ⊢ ((suc 𝑖 ∈ suc 𝑚 ∧ suc 𝑖 ≠ 𝑚) → suc 𝑖 ∈ 𝑚)
20	13, 19	stoic3 1778	. . . 4 ⊢ ((𝑛 = suc 𝑚 ∧ suc 𝑖 ∈ 𝑛 ∧ suc 𝑖 ≠ 𝑚) → suc 𝑖 ∈ 𝑚)
21	11, 20	syl3an3b 1402	. . 3 ⊢ ((𝑛 = suc 𝑚 ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖) → suc 𝑖 ∈ 𝑚)
22	21	3expb 1117	. 2 ⊢ ((𝑛 = suc 𝑚 ∧ (suc 𝑖 ∈ 𝑛 ∧ 𝑚 ≠ suc 𝑖)) → suc 𝑖 ∈ 𝑚)
23	6, 10, 22	syl2an 598	1 ⊢ ((𝜂 ∧ 𝜌) → suc 𝑖 ∈ 𝑚)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  suc csuc 6161  ωcom 7560   ∧ w-bnj17 32066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ne 2988  df-v 3443  df-un 3886  df-sn 4526  df-suc 6165  df-bnj17 32067

This theorem is referenced by:  bnj570  32287