Theorem bnj910 35245

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

Assertion

Ref	Expression
bnj910	⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜒″)

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

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

Proof of Theorem bnj910

Step	Hyp	Ref	Expression
1		bnj910.3	. . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
2		bnj910.10	. . . 4 ⊢ 𝐷 = (ω ∖ {∅})
3	1, 2	bnj970 35244	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝑝 ∈ 𝐷)
4		bnj910.1	. . . . 5 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
5		bnj910.2	. . . . 5 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
6		bnj910.12	. . . . 5 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑚) pred(𝑦, 𝐴, 𝑅)
7		bnj910.14	. . . . 5 ⊢ (𝜏 ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
8		bnj910.15	. . . . 5 ⊢ (𝜎 ↔ (𝑛 ∈ 𝐷 ∧ 𝑝 = suc 𝑛 ∧ 𝑚 ∈ 𝑛))
9	4, 5, 1, 2, 6, 7, 8	bnj969 35243	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝐶 ∈ V)
10		simpr3 1211	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝑝 = suc 𝑛)
11	1	bnj1235 35101	. . . . . 6 ⊢ (𝜒 → 𝑓 Fn 𝑛)
12	11	3ad2ant1 1147	. . . . 5 ⊢ ((𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) → 𝑓 Fn 𝑛)
13	12	adantl 485	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝑓 Fn 𝑛)
14		bnj910.13	. . . . . 6 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
15	14	bnj941 35070	. . . . 5 ⊢ (𝐶 ∈ V → ((𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛) → 𝐺 Fn 𝑝))
16	15	3impib 1130	. . . 4 ⊢ ((𝐶 ∈ V ∧ 𝑝 = suc 𝑛 ∧ 𝑓 Fn 𝑛) → 𝐺 Fn 𝑝)
17	9, 10, 13, 16	syl3anc 1392	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝐺 Fn 𝑝)
18		bnj910.4	. . . 4 ⊢ (𝜑′ ↔ [𝑝 / 𝑛]𝜑)
19		bnj910.7	. . . 4 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑′)
20	4, 5, 1, 18, 19, 2, 6, 14, 7, 8	bnj944 35235	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜑″)
21		bnj910.5	. . . 4 ⊢ (𝜓′ ↔ [𝑝 / 𝑛]𝜓)
22		bnj910.8	. . . 4 ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓′)
23	5, 1, 2, 6, 14, 9	bnj967 35242	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ suc 𝑖 ∈ 𝑛)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
24	1, 2, 6, 14, 9, 17	bnj966 35241	. . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝 ∧ 𝑛 = suc 𝑖)) → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
25	5, 1, 21, 22, 6, 14, 23, 24	bnj964 35240	. . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜓″)
26	3, 17, 20, 25	bnj951 35073	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → (𝑝 ∈ 𝐷 ∧ 𝐺 Fn 𝑝 ∧ 𝜑″ ∧ 𝜓″))
27		bnj910.6	. . . 4 ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒)
28		vex 3460	. . . 4 ⊢ 𝑝 ∈ V
29	1, 18, 21, 27, 28	bnj919 35065	. . 3 ⊢ (𝜒′ ↔ (𝑝 ∈ 𝐷 ∧ 𝑓 Fn 𝑝 ∧ 𝜑′ ∧ 𝜓′))
30		bnj910.9	. . 3 ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′)
31	14	bnj918 35064	. . 3 ⊢ 𝐺 ∈ V
32	29, 19, 22, 30, 31	bnj976 35075	. 2 ⊢ (𝜒″ ↔ (𝑝 ∈ 𝐷 ∧ 𝐺 Fn 𝑝 ∧ 𝜑″ ∧ 𝜓″))
33	26, 32	sylibr 236	1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) ∧ (𝜒 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) → 𝜒″)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  {cab 2742  ∀wral 3078  ∃wrex 3088  Vcvv 3456  [wsbc 3746   ∖ cdif 3903   ∪ cun 3904  ∅c0 4287  {csn 4584  ⟨cop 4590  ∪ ciun 4951  suc csuc 6350   Fn wfn 6518  ‘cfv 6523  ωcom 7848   ∧ w-bnj17 34984   predc-bnj14 34986   FrSe w-bnj15 34990

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pr 5392  ax-un 7720  ax-reg 9542

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-res 5661  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-fv 6531  df-om 7849  df-bnj17 34985  df-bnj14 34987  df-bnj13 34989  df-bnj15 34991

This theorem is referenced by:  bnj998  35254