Theorem bnj981 32217

Description: Technical lemma for bnj69 32277. 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
bnj981.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj981.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj981.3	⊢ 𝐷 = (ω ∖ {∅})
bnj981.4	⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
bnj981.5	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))

Assertion

Ref	Expression
bnj981	⊢ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))

Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝐷,𝑖,𝑦   𝑅,𝑓,𝑖,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛,𝑦   𝑓,𝑍,𝑖,𝑛,𝑦   𝜑,𝑖,𝑦

Allowed substitution hints:   𝜑(𝑓,𝑛)   𝜓(𝑦,𝑓,𝑖,𝑛)   𝜒(𝑦,𝑓,𝑖,𝑛)   𝐵(𝑦,𝑓,𝑖,𝑛)   𝐷(𝑓,𝑛)

Proof of Theorem bnj981

Step	Hyp	Ref	Expression
1		nfv 1911	. . . 4 ⊢ Ⅎ𝑦 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)
2		bnj981.2	. . . . . . . . . . . 12 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		nfcv 2977	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑦ω
4		nfv 1911	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦 suc 𝑖 ∈ 𝑛
5		nfiu1 4945	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑦∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
6	5	nfeq2 2995	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦(𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
7	4, 6	nfim 1893	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑦(suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
8	3, 7	nfralw 3225	. . . . . . . . . . . 12 ⊢ Ⅎ𝑦∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
9	2, 8	nfxfr 1849	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝜓
10	9	nf5ri 2191	. . . . . . . . . 10 ⊢ (𝜓 → ∀𝑦𝜓)
11		bnj981.5	. . . . . . . . . 10 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
12	10, 11	bnj1096 32049	. . . . . . . . 9 ⊢ (𝜒 → ∀𝑦𝜒)
13	12	nf5i 2146	. . . . . . . 8 ⊢ Ⅎ𝑦𝜒
14		nfv 1911	. . . . . . . 8 ⊢ Ⅎ𝑦 𝑖 ∈ 𝑛
15		nfv 1911	. . . . . . . 8 ⊢ Ⅎ𝑦 𝑍 ∈ (𝑓‘𝑖)
16	13, 14, 15	nf3an 1898	. . . . . . 7 ⊢ Ⅎ𝑦(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
17	16	nfex 2339	. . . . . 6 ⊢ Ⅎ𝑦∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
18	17	nfex 2339	. . . . 5 ⊢ Ⅎ𝑦∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
19	18	nfex 2339	. . . 4 ⊢ Ⅎ𝑦∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
20	1, 19	nfim 1893	. . 3 ⊢ Ⅎ𝑦(𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))
21		eleq1 2900	. . . 4 ⊢ (𝑦 = 𝑍 → (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)))
22		eleq1 2900	. . . . . 6 ⊢ (𝑦 = 𝑍 → (𝑦 ∈ (𝑓‘𝑖) ↔ 𝑍 ∈ (𝑓‘𝑖)))
23	22	3anbi3d 1438	. . . . 5 ⊢ (𝑦 = 𝑍 → ((𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
24	23	3exbidv 1922	. . . 4 ⊢ (𝑦 = 𝑍 → (∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
25	21, 24	imbi12d 347	. . 3 ⊢ (𝑦 = 𝑍 → ((𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))))
26		bnj981.1	. . . 4 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
27		bnj981.3	. . . 4 ⊢ 𝐷 = (ω ∖ {∅})
28		bnj981.4	. . . 4 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
29	26, 2, 27, 28, 11	bnj917 32201	. . 3 ⊢ (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
30	20, 25, 29	vtoclg1f 3566	. 2 ⊢ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
31	30	pm2.43i 52	1 ⊢ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ w3a 1083   = wceq 1533  ∃wex 1776   ∈ wcel 2110  {cab 2799  ∀wral 3138  ∃wrex 3139   ∖ cdif 3932  ∅c0 4290  {csn 4560  ∪ ciun 4911  suc csuc 6187   Fn wfn 6344  ‘cfv 6349  ωcom 7574   ∧ w-bnj17 31951   predc-bnj14 31953   trClc-bnj18 31959

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3496  df-iun 4913  df-fn 6352  df-bnj17 31952  df-bnj18 31960

This theorem is referenced by:  bnj1128  32257