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

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

Proof of Theorem bnj981
StepHypRef Expression
1 nfv 2005 . . . 4 𝑦 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)
2 bnj981.2 . . . . . . . . . . . 12 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 nfcv 2944 . . . . . . . . . . . . 13 𝑦ω
4 nfv 2005 . . . . . . . . . . . . . 14 𝑦 suc 𝑖𝑛
5 nfiu1 4735 . . . . . . . . . . . . . . 15 𝑦 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
65nfeq2 2960 . . . . . . . . . . . . . 14 𝑦(𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
74, 6nfim 1987 . . . . . . . . . . . . 13 𝑦(suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
83, 7nfral 3129 . . . . . . . . . . . 12 𝑦𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
92, 8nfxfr 1938 . . . . . . . . . . 11 𝑦𝜓
109nf5ri 2229 . . . . . . . . . 10 (𝜓 → ∀𝑦𝜓)
11 bnj981.5 . . . . . . . . . 10 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
1210, 11bnj1096 31170 . . . . . . . . 9 (𝜒 → ∀𝑦𝜒)
1312nf5i 2189 . . . . . . . 8 𝑦𝜒
14 nfv 2005 . . . . . . . 8 𝑦 𝑖𝑛
15 nfv 2005 . . . . . . . 8 𝑦 𝑍 ∈ (𝑓𝑖)
1613, 14, 15nf3an 1993 . . . . . . 7 𝑦(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1716nfex 2329 . . . . . 6 𝑦𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1817nfex 2329 . . . . 5 𝑦𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1918nfex 2329 . . . 4 𝑦𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
201, 19nfim 1987 . . 3 𝑦(𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))
21 eleq1 2869 . . . 4 (𝑦 = 𝑍 → (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)))
22 eleq1 2869 . . . . . 6 (𝑦 = 𝑍 → (𝑦 ∈ (𝑓𝑖) ↔ 𝑍 ∈ (𝑓𝑖)))
23223anbi3d 1559 . . . . 5 (𝑦 = 𝑍 → ((𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ (𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
24233exbidv 2015 . . . 4 (𝑦 = 𝑍 → (∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
2521, 24imbi12d 335 . . 3 (𝑦 = 𝑍 → ((𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖))) ↔ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))))
26 bnj981.1 . . . 4 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
27 bnj981.3 . . . 4 𝐷 = (ω ∖ {∅})
28 bnj981.4 . . . 4 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
2926, 2, 27, 28, 11bnj917 31321 . . 3 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
3020, 25, 29vtoclg1f 3454 . 2 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
3130pm2.43i 52 1 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  w3a 1100   = wceq 1637  wex 1859  wcel 2155  {cab 2788  wral 3092  wrex 3093  cdif 3760  c0 4110  {csn 4364   ciun 4705  suc csuc 5932   Fn wfn 6090  cfv 6095  ωcom 7289  w-bnj17 31071   predc-bnj14 31073   trClc-bnj18 31079
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2067  ax-7 2103  ax-9 2164  ax-10 2184  ax-11 2200  ax-12 2213  ax-13 2419  ax-ext 2781
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2060  df-clab 2789  df-cleq 2795  df-clel 2798  df-nfc 2933  df-ral 3097  df-rex 3098  df-v 3389  df-iun 4707  df-fn 6098  df-bnj17 31072  df-bnj18 31080
This theorem is referenced by:  bnj1128  31375
  Copyright terms: Public domain W3C validator