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 32188
Description: Technical lemma for bnj852 32195. 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 32187 1 (𝑛𝐷 → ∃*𝑓(𝑓 Fn 𝑛𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1083   = wceq 1537  wcel 2114  ∃*wmo 2620  wral 3140  [wsbc 3774  cdif 3935  c0 4293  {csn 4569   ciun 4921   class class class wbr 5068   E cep 5466  suc csuc 6195   Fn wfn 6352  cfv 6357  ωcom 7582   predc-bnj14 31960
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-fv 6365  df-om 7583  df-bnj17 31959
This theorem is referenced by:  bnj600  32193
  Copyright terms: Public domain W3C validator