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

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

Proof of Theorem bnj865
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 bnj865.1 . . . . . . 7 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 bnj865.2 . . . . . . 7 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj865.3 . . . . . . 7 𝐷 = (ω ∖ {∅})
41, 2, 3bnj852 35318 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
5 omex 9610 . . . . . . . . 9 ω ∈ V
6 difexg 5299 . . . . . . . . 9 (ω ∈ V → (ω ∖ {∅}) ∈ V)
75, 6ax-mp 5 . . . . . . . 8 (ω ∖ {∅}) ∈ V
83, 7eqeltri 2858 . . . . . . 7 𝐷 ∈ V
9 raleq 3319 . . . . . . . 8 (𝑧 = 𝐷 → (∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
10 raleq 3319 . . . . . . . . 9 (𝑧 = 𝐷 → (∀𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1110exbidv 1950 . . . . . . . 8 (𝑧 = 𝐷 → (∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
129, 11imbi12d 347 . . . . . . 7 (𝑧 = 𝐷 → ((∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ (∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
13 zfrep6 5249 . . . . . . 7 (∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
148, 12, 13vtocl 3524 . . . . . 6 (∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
154, 14syl 18 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
16 19.37v 2026 . . . . 5 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1715, 16mpbir 234 . . . 4 𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
18 df-ral 3079 . . . . . . . 8 (∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1918imbi2i 339 . . . . . . 7 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
20 19.21v 1968 . . . . . . 7 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
2119, 20bitr4i 281 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
2221exbii 1877 . . . . 5 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
23 impexp 455 . . . . . . . 8 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
24 df-3an 1104 . . . . . . . . . 10 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷))
2524bicomi 227 . . . . . . . . 9 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
2625imbi1i 352 . . . . . . . 8 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2723, 26bitr3i 280 . . . . . . 7 (((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2827albii 1848 . . . . . 6 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2928exbii 1877 . . . . 5 (∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3022, 29bitri 278 . . . 4 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3117, 30mpbi 233 . . 3 𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
32 bnj865.5 . . . . . . 7 (𝜒 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
3332bicomi 227 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) ↔ 𝜒)
3433imbi1i 352 . . . . 5 (((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ (𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3534albii 1848 . . . 4 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∀𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3635exbii 1877 . . 3 (∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3731, 36mpbi 233 . 2 𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
38 bnj865.6 . . . . . 6 (𝜃 ↔ (𝑓 Fn 𝑛𝜑𝜓))
3938rexbii 3111 . . . . 5 (∃𝑓𝑤 𝜃 ↔ ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
4039imbi2i 339 . . . 4 ((𝜒 → ∃𝑓𝑤 𝜃) ↔ (𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4140albii 1848 . . 3 (∀𝑛(𝜒 → ∃𝑓𝑤 𝜃) ↔ ∀𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4241exbii 1877 . 2 (∃𝑤𝑛(𝜒 → ∃𝑓𝑤 𝜃) ↔ ∃𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4337, 42mpbir 234 1 𝑤𝑛(𝜒 → ∃𝑓𝑤 𝜃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102  wal 1567   = wceq 1569  wex 1808  wcel 2142  ∃!weu 2595  wral 3078  wrex 3088  Vcvv 3454  cdif 3901  c0 4285  {csn 4588   ciun 4955  suc csuc 6362   Fn wfn 6531  cfv 6536  ωcom 7860   predc-bnj14 35086   FrSe w-bnj15 35090
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-reg 9552  ax-inf2 9608
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7861  df-1o 8451  df-bnj17 35085  df-bnj14 35087  df-bnj13 35089  df-bnj15 35091
This theorem is used by:  bnj849  35322
  Copyright terms: Public domain W3C validator