Theorem bnj986 35652

Description: Technical lemma for bnj69 35707. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj986.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj986.10	⊢ 𝐷 = (ω ∖ {∅})
bnj986.15	⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))

Assertion

Ref	Expression
bnj986	⊢ (𝜒 → ∃𝑚∃𝑝𝜏)

Distinct variable group:   𝑚,𝑛,𝑝

Allowed substitution hints:   𝜑(𝑓, 𝑚, 𝑛, 𝑝)   𝜓(𝑓, 𝑚, 𝑛, 𝑝)   𝜒(𝑓, 𝑚, 𝑛, 𝑝)   𝜏(𝑓, 𝑚, 𝑛, 𝑝)   𝐷(𝑓, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj986

Step	Hyp	Ref	Expression
1		bnj986.3	. . . . . 6 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
2		bnj986.10	. . . . . . 7 ⊢ 𝐷 = (ω ∖ {∅})
3	2	bnj158 35427	. . . . . 6 ⊢ (𝑛 ∈ 𝐷 → ∃𝑚 ∈ ω 𝑛 = suc 𝑚)
4	1, 3	bnj769 35460	. . . . 5 ⊢ (𝜒 → ∃𝑚 ∈ ω 𝑛 = suc 𝑚)
5	4	bnj1196 35491	. . . 4 ⊢ (𝜒 → ∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚))
6		vex 3458	. . . . . 6 ⊢ 𝑛 ∈ V
7	6	sucex 7841	. . . . 5 ⊢ suc 𝑛 ∈ V
8	7	isseti 3472	. . . 4 ⊢ ∃𝑝 𝑝 = suc 𝑛
9	5, 8	jctir 530	. . 3 ⊢ (𝜒 → (∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
10		exdistr 1989	. . . 4 ⊢ (∃𝑚∃𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛) ↔ ∃𝑚((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
11		19.41v 1984	. . . 4 ⊢ (∃𝑚((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛) ↔ (∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛))
12	10, 11	bitr2i 279	. . 3 ⊢ ((∃𝑚(𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ ∃𝑝 𝑝 = suc 𝑛) ↔ ∃𝑚∃𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
13	9, 12	sylib 221	. 2 ⊢ (𝜒 → ∃𝑚∃𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
14		bnj986.15	. . . 4 ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
15		df-3an 1105	. . . 4 ⊢ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ↔ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
16	14, 15	bitri 278	. . 3 ⊢ (𝜏 ↔ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
17	16	2exbii 1882	. 2 ⊢ (∃𝑚∃𝑝𝜏 ↔ ∃𝑚∃𝑝((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚) ∧ 𝑝 = suc 𝑛))
18	13, 17	sylibr 237	1 ⊢ (𝜒 → ∃𝑚∃𝑝𝜏)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090   ∖ cdif 4048  ∅c0 4281  {csn 4588  suc csuc 6379   Fn wfn 6550  ωcom 7898   ∧ w-bnj17 35384

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-tr 5216  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-om 7899  df-bnj17 35385

This theorem is used by:  bnj996  35653