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 35096
Description: Technical lemma for bnj852 35103. 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 261 . 2 ((𝑓 Fn 𝑛𝜑𝜓) ↔ (𝑓 Fn 𝑛𝜑𝜓))
4 biid 261 . 2 ([𝑔 / 𝑓]𝜑[𝑔 / 𝑓]𝜑)
5 biid 261 . 2 ([𝑔 / 𝑓]𝜓[𝑔 / 𝑓]𝜓)
6 biid 261 . 2 ([𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓) ↔ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓))
7 bnj579.3 . 2 𝐷 = (ω ∖ {∅})
8 biid 261 . 2 (((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗)) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗)))
9 biid 261 . 2 (∀𝑘𝑛 (𝑘 E 𝑗[𝑘 / 𝑗]((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗))) ↔ ∀𝑘𝑛 (𝑘 E 𝑗[𝑘 / 𝑗]((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ [𝑔 / 𝑓](𝑓 Fn 𝑛𝜑𝜓)) → (𝑓𝑗) = (𝑔𝑗))))
101, 2, 3, 4, 5, 6, 7, 8, 9bnj580 35095 1 (𝑛𝐷 → ∃*𝑓(𝑓 Fn 𝑛𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  w3a 1087   = wceq 1542  wcel 2114  ∃*wmo 2538  wral 3052  [wsbc 3742  cdif 3900  c0 4287  {csn 4582   ciun 4948   class class class wbr 5100   E cep 5533  suc csuc 6329   Fn wfn 6497  cfv 6502  ωcom 7820   predc-bnj14 34871
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-fv 6510  df-om 7821  df-bnj17 34870
This theorem is referenced by:  bnj600  35101
  Copyright terms: Public domain W3C validator