Theorem bnj579 35544

Description: Technical lemma for bnj852 35551. 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
bnj579.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj579.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj579.3	⊢ 𝐷 = (ω ∖ {∅})

Assertion

Ref	Expression
bnj579	⊢ (𝑛 ∈ 𝐷 → ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))

Distinct variable groups:   𝐴,𝑓,𝑖   𝐷,𝑓   𝑅,𝑓,𝑖   𝑓,𝑛,𝑖   𝑥,𝑓   𝑦,𝑓,𝑖

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑖, 𝑛)   𝐴(𝑥, 𝑦, 𝑛)   𝐷(𝑥, 𝑦, 𝑖, 𝑛)   𝑅(𝑥, 𝑦, 𝑛)

Proof of Theorem bnj579

Dummy variables 𝑘 𝑔 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj579.1	. 2 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2		bnj579.2	. 2 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		biid 264	. 2 ⊢ ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4		biid 264	. 2 ⊢ ([𝑔 / 𝑓]𝜑 ↔ [𝑔 / 𝑓]𝜑)
5		biid 264	. 2 ⊢ ([𝑔 / 𝑓]𝜓 ↔ [𝑔 / 𝑓]𝜓)
6		biid 264	. 2 ⊢ ([𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ [𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
7		bnj579.3	. 2 ⊢ 𝐷 = (ω ∖ {∅})
8		biid 264	. 2 ⊢ (((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) → (𝑓‘𝑗) = (𝑔‘𝑗)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) → (𝑓‘𝑗) = (𝑔‘𝑗)))
9		biid 264	. 2 ⊢ (∀𝑘 ∈ 𝑛 (𝑘 E 𝑗 → [𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) → (𝑓‘𝑗) = (𝑔‘𝑗))) ↔ ∀𝑘 ∈ 𝑛 (𝑘 E 𝑗 → [𝑘 / 𝑗]((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) → (𝑓‘𝑗) = (𝑔‘𝑗))))
10	1, 2, 3, 4, 5, 6, 7, 8, 9	bnj580 35543	1 ⊢ (𝑛 ∈ 𝐷 → ∃*𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃*wmo 2562  ∀wral 3076  [wsbc 3738   ∖ cdif 4045  ∅c0 4278  {csn 4583  ∪ ciun 4950   class class class wbr 5102   E cep 5549  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   predc-bnj14 35319

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-om 7878  df-bnj17 35318

This theorem is used by:  bnj600  35549