Theorem bnj1014 35296

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

Assertion

Ref	Expression
bnj1014	⊢ ((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))

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

Allowed substitution hints:   𝜑(𝑦,𝑓,𝑔,𝑗,𝑛)   𝜓(𝑦,𝑓,𝑔,𝑖,𝑗,𝑛)   𝐴(𝑔,𝑗)   𝐵(𝑦,𝑓,𝑔,𝑖,𝑗,𝑛)   𝐷(𝑦,𝑓,𝑔,𝑗,𝑛)   𝑅(𝑔,𝑗)   𝑋(𝑔,𝑗)

Proof of Theorem bnj1014

Step	Hyp	Ref	Expression
1		bnj1014.14	. . . . . . 7 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
2		nfcv 2931	. . . . . . . . 9 ⊢ Ⅎ𝑖𝐷
3		bnj1014.1	. . . . . . . . . . 11 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4		bnj1014.2	. . . . . . . . . . 11 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
5	3, 4	bnj911 35267	. . . . . . . . . 10 ⊢ ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → ∀𝑖(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
6	5	nf5i 2187	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)
7	2, 6	nfrexw 3319	. . . . . . . 8 ⊢ Ⅎ𝑖∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)
8	7	nfab 2937	. . . . . . 7 ⊢ Ⅎ𝑖{𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
9	1, 8	nfcxfr 2929	. . . . . 6 ⊢ Ⅎ𝑖𝐵
10	9	nfcri 2923	. . . . 5 ⊢ Ⅎ𝑖 𝑔 ∈ 𝐵
11		nfv 1941	. . . . 5 ⊢ Ⅎ𝑖 𝑗 ∈ dom 𝑔
12	10, 11	nfan 1926	. . . 4 ⊢ Ⅎ𝑖(𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔)
13		nfv 1941	. . . 4 ⊢ Ⅎ𝑖(𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)
14	12, 13	nfim 1923	. . 3 ⊢ Ⅎ𝑖((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
15	14	nf5ri 2237	. 2 ⊢ (((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) → ∀𝑖((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)))
16		eleq1w 2852	. . . . . 6 ⊢ (𝑗 = 𝑖 → (𝑗 ∈ dom 𝑔 ↔ 𝑖 ∈ dom 𝑔))
17	16	anbi2d 641	. . . . 5 ⊢ (𝑗 = 𝑖 → ((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) ↔ (𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔)))
18		fveq2 6884	. . . . . 6 ⊢ (𝑗 = 𝑖 → (𝑔‘𝑗) = (𝑔‘𝑖))
19	18	sseq1d 3976	. . . . 5 ⊢ (𝑗 = 𝑖 → ((𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)))
20	17, 19	imbi12d 347	. . . 4 ⊢ (𝑗 = 𝑖 → (((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔) → (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
21	20	equcoms 2047	. . 3 ⊢ (𝑖 = 𝑗 → (((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔) → (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
22	1	bnj1317 35156	. . . . . . 7 ⊢ (𝑔 ∈ 𝐵 → ∀𝑓 𝑔 ∈ 𝐵)
23	22	nf5i 2187	. . . . . 6 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐵
24		nfv 1941	. . . . . 6 ⊢ Ⅎ𝑓 𝑖 ∈ dom 𝑔
25	23, 24	nfan 1926	. . . . 5 ⊢ Ⅎ𝑓(𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔)
26		nfv 1941	. . . . 5 ⊢ Ⅎ𝑓(𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)
27	25, 26	nfim 1923	. . . 4 ⊢ Ⅎ𝑓((𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔) → (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
28		eleq1w 2852	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐵 ↔ 𝑔 ∈ 𝐵))
29		dmeq 5896	. . . . . . 7 ⊢ (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
30	29	eleq2d 2855	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ dom 𝑔))
31	28, 30	anbi12d 643	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑓) ↔ (𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔)))
32		fveq1 6883	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑖) = (𝑔‘𝑖))
33	32	sseq1d 3976	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)))
34	31, 33	imbi12d 347	. . . 4 ⊢ (𝑓 = 𝑔 → (((𝑓 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔) → (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
35		ssiun2 5016	. . . . 5 ⊢ (𝑖 ∈ dom 𝑓 → (𝑓‘𝑖) ⊆ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖))
36		ssiun2 5016	. . . . . 6 ⊢ (𝑓 ∈ 𝐵 → ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖))
37		bnj1014.13	. . . . . . 7 ⊢ 𝐷 = (ω ∖ {∅})
38	3, 4, 37, 1	bnj882 35261	. . . . . 6 ⊢ trCl(𝑋, 𝐴, 𝑅) = ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)
39	36, 38	sseqtrrdi 3986	. . . . 5 ⊢ (𝑓 ∈ 𝐵 → ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
40	35, 39	sylan9ssr 3959	. . . 4 ⊢ ((𝑓 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
41	27, 34, 40	chvarfv 2282	. . 3 ⊢ ((𝑔 ∈ 𝐵 ∧ 𝑖 ∈ dom 𝑔) → (𝑔‘𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
42	21, 41	speivw 2000	. 2 ⊢ ∃𝑖((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
43	15, 42	bnj1131 35123	1 ⊢ ((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∃wrex 3095   ∖ cdif 3910   ⊆ wss 3913  ∅c0 4294  {csn 4594  ∪ ciun 4960  dom cdm 5664  suc csuc 6365   Fn wfn 6534  ‘cfv 6539  ωcom 7864   predc-bnj14 35024   trClc-bnj18 35030

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-dm 5674  df-iota 6495  df-fv 6547  df-bnj18 35031

This theorem is referenced by:  bnj1015  35297