Theorem bnj535 34868

Description: Technical lemma for bnj852 34899. 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
bnj535.1	⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj535.2	⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj535.3	⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj535.4	⊢ (𝜏 ↔ (𝜑′ ∧ 𝜓′ ∧ 𝑚 ∈ ω ∧ 𝑝 ∈ 𝑚))

Assertion

Ref	Expression
bnj535	⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) → 𝐺 Fn 𝑛)

Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝   𝑝,𝜑′

Allowed substitution hints:   𝜏(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑥,𝑓,𝑚,𝑛)   𝑅(𝑥,𝑓,𝑚,𝑛)   𝐺(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj535

Step	Hyp	Ref	Expression
1		bnj422 34693	. . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) ↔ (𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚 ∧ 𝑅 FrSe 𝐴 ∧ 𝜏))
2		bnj251 34680	. . 3 ⊢ ((𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚 ∧ 𝑅 FrSe 𝐴 ∧ 𝜏) ↔ (𝑛 = (𝑚 ∪ {𝑚}) ∧ (𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏))))
3	1, 2	bitri 275	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) ↔ (𝑛 = (𝑚 ∪ {𝑚}) ∧ (𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏))))
4		fvex 6935	. . . . . . . . 9 ⊢ (𝑓‘𝑝) ∈ V
5		bnj535.1	. . . . . . . . . 10 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
6		bnj535.2	. . . . . . . . . 10 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
7		bnj535.4	. . . . . . . . . 10 ⊢ (𝜏 ↔ (𝜑′ ∧ 𝜓′ ∧ 𝑚 ∈ ω ∧ 𝑝 ∈ 𝑚))
8	5, 6, 7	bnj518 34864	. . . . . . . . 9 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → ∀𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
9		iunexg 8006	. . . . . . . . 9 ⊢ (((𝑓‘𝑝) ∈ V ∧ ∀𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
10	4, 8, 9	sylancr 586	. . . . . . . 8 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
11		vex 3492	. . . . . . . . 9 ⊢ 𝑚 ∈ V
12	11	bnj519 34714	. . . . . . . 8 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V → Fun {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
13	10, 12	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → Fun {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
14		dmsnopg 6246	. . . . . . . 8 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V → dom {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩} = {𝑚})
15	10, 14	syl 17	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → dom {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩} = {𝑚})
16	13, 15	bnj1422 34815	. . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩} Fn {𝑚})
17		disjcsn 9675	. . . . . . 7 ⊢ (𝑚 ∩ {𝑚}) = ∅
18		fnun 6695	. . . . . . 7 ⊢ (((𝑓 Fn 𝑚 ∧ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩} Fn {𝑚}) ∧ (𝑚 ∩ {𝑚}) = ∅) → (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩}) Fn (𝑚 ∪ {𝑚}))
19	17, 18	mpan2 690	. . . . . 6 ⊢ ((𝑓 Fn 𝑚 ∧ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩} Fn {𝑚}) → (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩}) Fn (𝑚 ∪ {𝑚}))
20	16, 19	sylan2 592	. . . . 5 ⊢ ((𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏)) → (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩}) Fn (𝑚 ∪ {𝑚}))
21		bnj535.3	. . . . . 6 ⊢ 𝐺 = (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
22	21	fneq1i 6678	. . . . 5 ⊢ (𝐺 Fn (𝑚 ∪ {𝑚}) ↔ (𝑓 ∪ {⟨𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)⟩}) Fn (𝑚 ∪ {𝑚}))
23	20, 22	sylibr 234	. . . 4 ⊢ ((𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏)) → 𝐺 Fn (𝑚 ∪ {𝑚}))
24		fneq2 6673	. . . 4 ⊢ (𝑛 = (𝑚 ∪ {𝑚}) → (𝐺 Fn 𝑛 ↔ 𝐺 Fn (𝑚 ∪ {𝑚})))
25	23, 24	imbitrrid 246	. . 3 ⊢ (𝑛 = (𝑚 ∪ {𝑚}) → ((𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏)) → 𝐺 Fn 𝑛))
26	25	imp 406	. 2 ⊢ ((𝑛 = (𝑚 ∪ {𝑚}) ∧ (𝑓 Fn 𝑚 ∧ (𝑅 FrSe 𝐴 ∧ 𝜏))) → 𝐺 Fn 𝑛)
27	3, 26	sylbi 217	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) → 𝐺 Fn 𝑛)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  Vcvv 3488   ∪ cun 3974   ∩ cin 3975  ∅c0 4352  {csn 4648  ⟨cop 4654  ∪ ciun 5015  dom cdm 5700  suc csuc 6399  Fun wfun 6569   Fn wfn 6570  ‘cfv 6575  ωcom 7905   ∧ w-bnj17 34664   predc-bnj14 34666   FrSe w-bnj15 34670

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7772  ax-reg 9663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-ord 6400  df-on 6401  df-lim 6402  df-suc 6403  df-iota 6527  df-fun 6577  df-fn 6578  df-fv 6583  df-om 7906  df-bnj17 34665  df-bnj14 34667  df-bnj13 34669  df-bnj15 34671

This theorem is referenced by:  bnj543  34871