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

Theorem bnj864 32196
Description: Technical lemma for bnj69 32284. 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
bnj864.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj864.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj864.3 𝐷 = (ω ∖ {∅})
bnj864.4 (𝜒 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
bnj864.5 (𝜃 ↔ (𝑓 Fn 𝑛𝜑𝜓))
Assertion
Ref Expression
bnj864 (𝜒 → ∃!𝑓𝜃)
Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝐷,𝑓,𝑖,𝑛   𝑅,𝑓,𝑖,𝑛,𝑦   𝑓,𝑋,𝑛
Allowed substitution hints:   𝜑(𝑦,𝑓,𝑖,𝑛)   𝜓(𝑦,𝑓,𝑖,𝑛)   𝜒(𝑦,𝑓,𝑖,𝑛)   𝜃(𝑦,𝑓,𝑖,𝑛)   𝐷(𝑦)   𝑋(𝑦,𝑖)

Proof of Theorem bnj864
StepHypRef Expression
1 bnj864.1 . . . . 5 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 bnj864.2 . . . . 5 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj864.3 . . . . 5 𝐷 = (ω ∖ {∅})
41, 2, 3bnj852 32195 . . . 4 ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
5 df-ral 3145 . . . . . 6 (∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛(𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
65imbi2i 338 . . . . 5 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))))
7 19.21v 1940 . . . . 5 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))))
8 impexp 453 . . . . . . 7 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))))
9 df-3an 1085 . . . . . . . . 9 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷))
109bicomi 226 . . . . . . . 8 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
1110imbi1i 352 . . . . . . 7 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
128, 11bitr3i 279 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
1312albii 1820 . . . . 5 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
146, 7, 133bitr2i 301 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
154, 14mpbi 232 . . 3 𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
1615spi 2183 . 2 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
17 bnj864.4 . 2 (𝜒 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
18 bnj864.5 . . 3 (𝜃 ↔ (𝑓 Fn 𝑛𝜑𝜓))
1918eubii 2670 . 2 (∃!𝑓𝜃 ↔ ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
2016, 17, 193imtr4i 294 1 (𝜒 → ∃!𝑓𝜃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083  wal 1535   = wceq 1537  wcel 2114  ∃!weu 2653  wral 3140  cdif 3935  c0 4293  {csn 4569   ciun 4921  suc csuc 6195   Fn wfn 6352  cfv 6357  ωcom 7582   predc-bnj14 31960   FrSe w-bnj15 31964
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-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-reg 9058  ax-inf2 9106
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-reu 3147  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-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-om 7583  df-1o 8104  df-bnj17 31959  df-bnj14 31961  df-bnj13 31963  df-bnj15 31965
This theorem is referenced by:  bnj849  32199
  Copyright terms: Public domain W3C validator