Theorem bnj1006 31477

Description: Technical lemma for bnj69 31526. 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
bnj1006.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1006.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1006.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1006.4	⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
bnj1006.5	⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
bnj1006.6	⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
bnj1006.7	⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
bnj1006.8	⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
bnj1006.9	⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒)
bnj1006.10	⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
bnj1006.11	⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
bnj1006.12	⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′)
bnj1006.13	⊢ 𝐷 = (ω ∖ {∅})
bnj1006.15	⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
bnj1006.16	⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj1006.28	⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))

Assertion

Ref	Expression
bnj1006	⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))

Distinct variable groups:   𝐴,𝑓,𝑖,𝑚,𝑛,𝑦   𝐷,𝑓,𝑛   𝑖,𝐺   𝑅,𝑓,𝑖,𝑚,𝑛,𝑦   𝑓,𝑋,𝑛   𝑓,𝑝,𝑖,𝑛

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

Proof of Theorem bnj1006

Step	Hyp	Ref	Expression
1		bnj1006.6	. . . . 5 ⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
2	1	simprbi 490	. . . 4 ⊢ (𝜂 → 𝑦 ∈ (𝑓‘𝑖))
3	2	bnj708 31274	. . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑦 ∈ (𝑓‘𝑖))
4		bnj1006.4	. . . . . . . 8 ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
5		bnj253 31221	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)))
6	5	simp1bi 1175	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ∧ 𝑧 ∈ pred(𝑦, 𝐴, 𝑅)) → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
7	4, 6	sylbi 208	. . . . . . 7 ⊢ (𝜃 → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
8	7	bnj705 31271	. . . . . 6 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
9		bnj643 31267	. . . . . . 7 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒)
10		bnj1006.5	. . . . . . . . 9 ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
11		3simpc 1182	. . . . . . . . 9 ⊢ ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
12	10, 11	sylbi 208	. . . . . . . 8 ⊢ (𝜏 → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
13	12	bnj707 31273	. . . . . . 7 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
14		3anass 1116	. . . . . . 7 ⊢ ((𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ↔ (𝜒 ∧ (𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)))
15	9, 13, 14	sylanbrc 578	. . . . . 6 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛))
16		bnj1006.1	. . . . . . 7 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
17		bnj1006.2	. . . . . . 7 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18		bnj1006.3	. . . . . . 7 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
19		bnj1006.13	. . . . . . 7 ⊢ 𝐷 = (ω ∖ {∅})
20		bnj1006.15	. . . . . . 7 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
21		biid 252	. . . . . . 7 ⊢ ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
22		biid 252	. . . . . . 7 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑝 = suc 𝑛 ∧ 𝑚 ∈ 𝑛) ↔ (𝑛 ∈ 𝐷 ∧ 𝑝 = suc 𝑛 ∧ 𝑚 ∈ 𝑛))
23	16, 17, 18, 19, 20, 21, 22	bnj969 31464	. . . . . 6 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝐶 ∈ V)
24	8, 15, 23	syl2anc 579	. . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝐶 ∈ V)
25	18	bnj1235 31323	. . . . . 6 ⊢ (𝜒 → 𝑓 Fn 𝑛)
26	25	bnj706 31272	. . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑓 Fn 𝑛)
27	10	simp3bi 1177	. . . . . 6 ⊢ (𝜏 → 𝑝 = suc 𝑛)
28	27	bnj707 31273	. . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑝 = suc 𝑛)
29	1	simplbi 491	. . . . . 6 ⊢ (𝜂 → 𝑖 ∈ 𝑛)
30	29	bnj708 31274	. . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑖 ∈ 𝑛)
31	24, 26, 28, 30	bnj951 31294	. . . 4 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝑖 ∈ 𝑛))
32		bnj1006.16	. . . . 5 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
33	32	bnj945 31292	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛 ∧ 𝑝 = suc 𝑛 ∧ 𝑖 ∈ 𝑛) → (𝐺‘𝑖) = (𝑓‘𝑖))
34	31, 33	syl 17	. . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝐺‘𝑖) = (𝑓‘𝑖))
35	3, 34	eleqtrrd 2847	. 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑦 ∈ (𝐺‘𝑖))
36		bnj1006.28	. . . . 5 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝))
37	36	anim1i 608	. . . 4 ⊢ (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑦 ∈ (𝐺‘𝑖)))
38		df-bnj17 31204	. . . 4 ⊢ ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)) ↔ ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝) ∧ 𝑦 ∈ (𝐺‘𝑖)))
39	37, 38	sylibr 225	. . 3 ⊢ (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)))
40		bnj1006.7	. . . 4 ⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
41		bnj1006.8	. . . 4 ⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
42		bnj1006.9	. . . 4 ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒)
43		bnj1006.10	. . . 4 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
44		bnj1006.11	. . . 4 ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
45		bnj1006.12	. . . 4 ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′)
46	16, 17, 18, 40, 41, 42, 43, 44, 45, 20, 32	bnj999 31475	. . 3 ⊢ ((𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑦 ∈ (𝐺‘𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
47	39, 46	syl 17	. 2 ⊢ (((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ∧ 𝑦 ∈ (𝐺‘𝑖)) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))
48	35, 47	mpdan 678	1 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → pred(𝑦, 𝐴, 𝑅) ⊆ (𝐺‘suc 𝑖))

Syntax hints:   → wi 4   ↔ wb 197   ∧ wa 384   ∧ w3a 1107   = wceq 1652   ∈ wcel 2155  ∀wral 3055  Vcvv 3350  [wsbc 3596   ∖ cdif 3729   ∪ cun 3730   ⊆ wss 3732  ∅c0 4079  {csn 4334  ⟨cop 4340  ∪ ciun 4676  suc csuc 5910   Fn wfn 6063  ‘cfv 6068  ωcom 7263   ∧ w-bnj17 31203   predc-bnj14 31205   FrSe w-bnj15 31209   trClc-bnj18 31211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-rep 4930  ax-sep 4941  ax-nul 4949  ax-pr 5062  ax-un 7147  ax-reg 8704

This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3or 1108  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2063  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ne 2938  df-ral 3060  df-rex 3061  df-reu 3062  df-rab 3064  df-v 3352  df-sbc 3597  df-csb 3692  df-dif 3735  df-un 3737  df-in 3739  df-ss 3746  df-pss 3748  df-nul 4080  df-if 4244  df-pw 4317  df-sn 4335  df-pr 4337  df-tp 4339  df-op 4341  df-uni 4595  df-iun 4678  df-br 4810  df-opab 4872  df-mpt 4889  df-tr 4912  df-id 5185  df-eprel 5190  df-po 5198  df-so 5199  df-fr 5236  df-we 5238  df-xp 5283  df-rel 5284  df-cnv 5285  df-co 5286  df-dm 5287  df-rn 5288  df-res 5289  df-ima 5290  df-ord 5911  df-on 5912  df-lim 5913  df-suc 5914  df-iota 6031  df-fun 6070  df-fn 6071  df-f 6072  df-f1 6073  df-fo 6074  df-f1o 6075  df-fv 6076  df-om 7264  df-bnj17 31204  df-bnj14 31206  df-bnj13 31208  df-bnj15 31210

This theorem is referenced by:  bnj1020  31481