Theorem bnj1021 34958

Description: Technical lemma for bnj69 35002. 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
bnj1021.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1021.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1021.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1021.4	⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
bnj1021.5	⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
bnj1021.6	⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
bnj1021.13	⊢ 𝐷 = (ω ∖ {∅})
bnj1021.14	⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}

Assertion

Ref	Expression
bnj1021	⊢ ∃𝑓∃𝑛∃𝑖∃𝑚(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏))

Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝐷,𝑖   𝑅,𝑓,𝑖,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛,𝑦   𝜒,𝑚,𝑝   𝜂,𝑚,𝑝   𝜃,𝑓,𝑖,𝑛   𝜑,𝑖   𝑚,𝑛,𝜃,𝑝

Allowed substitution hints:   𝜑(𝑦,𝑧,𝑓,𝑚,𝑛,𝑝)   𝜓(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒(𝑦,𝑧,𝑓,𝑖,𝑛)   𝜃(𝑦,𝑧)   𝜏(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜂(𝑦,𝑧,𝑓,𝑖,𝑛)   𝐴(𝑧,𝑚,𝑝)   𝐵(𝑦,𝑧,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑦,𝑧,𝑓,𝑚,𝑛,𝑝)   𝑅(𝑧,𝑚,𝑝)   𝑋(𝑧,𝑚,𝑝)

Proof of Theorem bnj1021

Step	Hyp	Ref	Expression
1		bnj1021.1	. . . 4 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2		bnj1021.2	. . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		bnj1021.3	. . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4		bnj1021.4	. . . 4 ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
5		bnj1021.5	. . . 4 ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
6		bnj1021.6	. . . 4 ⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
7		bnj1021.13	. . . 4 ⊢ 𝐷 = (ω ∖ {∅})
8		bnj1021.14	. . . 4 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
9	1, 2, 3, 4, 5, 6, 7, 8	bnj996 34948	. . 3 ⊢ ∃𝑓∃𝑛∃𝑖∃𝑚∃𝑝(𝜃 → (𝜒 ∧ 𝜏 ∧ 𝜂))
10		anclb 545	. . . . . 6 ⊢ ((𝜃 → (𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → (𝜃 ∧ (𝜒 ∧ 𝜏 ∧ 𝜂))))
11		bnj252 34695	. . . . . . 7 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ (𝜃 ∧ (𝜒 ∧ 𝜏 ∧ 𝜂)))
12	11	imbi2i 336	. . . . . 6 ⊢ ((𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → (𝜃 ∧ (𝜒 ∧ 𝜏 ∧ 𝜂))))
13	10, 12	bitr4i 278	. . . . 5 ⊢ ((𝜃 → (𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)))
14	13	2exbii 1849	. . . 4 ⊢ (∃𝑚∃𝑝(𝜃 → (𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ ∃𝑚∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)))
15	14	3exbii 1850	. . 3 ⊢ (∃𝑓∃𝑛∃𝑖∃𝑚∃𝑝(𝜃 → (𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ ∃𝑓∃𝑛∃𝑖∃𝑚∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)))
16	9, 15	mpbi 230	. 2 ⊢ ∃𝑓∃𝑛∃𝑖∃𝑚∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂))
17		19.37v 1991	. . . . 5 ⊢ (∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → ∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)))
18		bnj1019 34771	. . . . . 6 ⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏))
19	18	imbi2i 336	. . . . 5 ⊢ ((𝜃 → ∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏)))
20	17, 19	bitri 275	. . . 4 ⊢ (∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ (𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏)))
21	20	2exbii 1849	. . 3 ⊢ (∃𝑖∃𝑚∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ ∃𝑖∃𝑚(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏)))
22	21	2exbii 1849	. 2 ⊢ (∃𝑓∃𝑛∃𝑖∃𝑚∃𝑝(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂)) ↔ ∃𝑓∃𝑛∃𝑖∃𝑚(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏)))
23	16, 22	mpbi 230	1 ⊢ ∃𝑓∃𝑛∃𝑖∃𝑚(𝜃 → (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1540  ∃wex 1779   ∈ wcel 2108  {cab 2713  ∀wral 3060  ∃wrex 3069   ∖ cdif 3947  ∅c0 4332  {csn 4624  ∪ ciun 4989  suc csuc 6384   Fn wfn 6554  ‘cfv 6559  ωcom 7883   ∧ w-bnj17 34678   predc-bnj14 34680   FrSe w-bnj15 34684   trClc-bnj18 34686

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2177  ax-ext 2707  ax-sep 5294  ax-nul 5304  ax-pr 5430  ax-un 7751

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4906  df-iun 4991  df-br 5142  df-opab 5204  df-tr 5258  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5635  df-we 5637  df-ord 6385  df-on 6386  df-lim 6387  df-suc 6388  df-fn 6562  df-om 7884  df-bnj17 34679  df-bnj18 34687

This theorem is referenced by:  bnj907  34959