Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj579 Structured version   Visualization version   GIF version

Theorem bnj579 35111
Description: Technical lemma for bnj852 35118. 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.
StepHypRef Expression
1 bnj579.1 . 2 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2 bnj579.2 . 2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 biid 263 . 2 ((𝑓 Fn 𝑛𝜑𝜓) ↔ (𝑓 Fn 𝑛𝜑𝜓))
4 biid 263 . 2 ([𝑔 / 𝑓]𝜑[𝑔 / 𝑓]𝜑)
5 biid 263 . 2 ([𝑔 / 𝑓]𝜓[𝑔 / 𝑓]𝜓)
6 biid 263 . 2 ([𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓) ↔ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓))
7 bnj579.3 . 2 𝐷 = (ω ∖ {∅})
8 biid 263 . 2 (((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗)) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗)))
9 biid 263 . 2 (∀𝑘𝑛 (𝑘 E 𝑗[𝑘 / 𝑗]((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗))) ↔ ∀𝑘𝑛 (𝑘 E 𝑗[𝑘 / 𝑗]((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗))))
101, 2, 3, 4, 5, 6, 7, 8, 9bnj580 35110 1 (𝑛𝐷 → ∃*𝑓(𝑓 Fn 𝑛𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1093   = wceq 1548  wcel 2121  ∃*wmo 2543  wral 3055  [wsbc 3725  cdif 3882  c0 4264  {csn 4558   ciun 4924   class class class wbr 5075   E cep 5520  suc csuc 6316   Fn wfn 6484  cfv 6489  ωcom 7810   predc-bnj14 34886
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-fv 6497  df-om 7811  df-bnj17 34885
This theorem is referenced by:  bnj600  35116
  Copyright terms: Public domain W3C validator