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 35220
Description: Technical lemma for bnj69 35307. 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 35218 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))
5 omex 9600 . . . . . . . . 9 ω ∈ V
6 difexg 5287 . . . . . . . . 9 (ω ∈ V → (ω ∖ {∅}) ∈ V)
75, 6ax-mp 5 . . . . . . . 8 (ω ∖ {∅}) ∈ V
83, 7eqeltri 2860 . . . . . . 7 𝐷 ∈ V
9 raleq 3319 . . . . . . . 8 (𝑧 = 𝐷 → (∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
10 raleq 3319 . . . . . . . . 9 (𝑧 = 𝐷 → (∀𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1110exbidv 1943 . . . . . . . 8 (𝑧 = 𝐷 → (∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
129, 11imbi12d 346 . . . . . . 7 (𝑧 = 𝐷 → ((∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ (∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
13 zfrep6 5241 . . . . . . 7 (∀𝑛𝑧 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝑧𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
148, 12, 13vtocl 3527 . . . . . 6 (∀𝑛𝐷 ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
154, 14syl 17 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
16 19.37v 2019 . . . . 5 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∃𝑤𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1715, 16mpbir 233 . . . 4 𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
18 df-ral 3079 . . . . . . . 8 (∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
1918imbi2i 338 . . . . . . 7 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
20 19.21v 1961 . . . . . . 7 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛(𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
2119, 20bitr4i 280 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
2221exbii 1870 . . . . 5 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
23 impexp 454 . . . . . . . 8 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))))
24 df-3an 1101 . . . . . . . . . 10 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) ↔ ((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷))
2524bicomi 226 . . . . . . . . 9 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
2625imbi1i 351 . . . . . . . 8 ((((𝑅 FrSe 𝐴𝑋𝐴) ∧ 𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2723, 26bitr3i 279 . . . . . . 7 (((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2827albii 1841 . . . . . 6 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
2928exbii 1870 . . . . 5 (∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴) → (𝑛𝐷 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3022, 29bitri 277 . . . 4 (∃𝑤((𝑅 FrSe 𝐴𝑋𝐴) → ∀𝑛𝐷𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3117, 30mpbi 232 . . 3 𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
32 bnj865.5 . . . . . . 7 (𝜒 ↔ (𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷))
3332bicomi 226 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) ↔ 𝜒)
3433imbi1i 351 . . . . 5 (((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ (𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3534albii 1841 . . . 4 (∀𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∀𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3635exbii 1870 . . 3 (∃𝑤𝑛((𝑅 FrSe 𝐴𝑋𝐴𝑛𝐷) → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)) ↔ ∃𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
3731, 36mpbi 232 . 2 𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
38 bnj865.6 . . . . . 6 (𝜃 ↔ (𝑓 Fn 𝑛𝜑𝜓))
3938rexbii 3111 . . . . 5 (∃𝑓𝑤 𝜃 ↔ ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓))
4039imbi2i 338 . . . 4 ((𝜒 → ∃𝑓𝑤 𝜃) ↔ (𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4140albii 1841 . . 3 (∀𝑛(𝜒 → ∃𝑓𝑤 𝜃) ↔ ∀𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4241exbii 1870 . 2 (∃𝑤𝑛(𝜒 → ∃𝑓𝑤 𝜃) ↔ ∃𝑤𝑛(𝜒 → ∃𝑓𝑤 (𝑓 Fn 𝑛𝜑𝜓)))
4337, 42mpbir 233 1 𝑤𝑛(𝜒 → ∃𝑓𝑤 𝜃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1099  wal 1560   = wceq 1562  wex 1801  wcel 2144  ∃!weu 2597  wral 3078  wrex 3088  Vcvv 3456  cdif 3903  c0 4287  {csn 4584   ciun 4951  suc csuc 6350   Fn wfn 6518  cfv 6523  ωcom 7848   predc-bnj14 34986   FrSe w-bnj15 34990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-reg 9542  ax-inf2 9598
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-om 7849  df-1o 8439  df-bnj17 34985  df-bnj14 34987  df-bnj13 34989  df-bnj15 34991
This theorem is referenced by:  bnj849  35222
  Copyright terms: Public domain W3C validator