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 31358
 Description: Technical lemma for bnj69 31416. 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 1995 . . . 4 𝑦 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)
2 bnj981.2 . . . . . . . . . . . 12 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 nfcv 2913 . . . . . . . . . . . . 13 𝑦ω
4 nfv 1995 . . . . . . . . . . . . . 14 𝑦 suc 𝑖𝑛
5 nfiu1 4684 . . . . . . . . . . . . . . 15 𝑦 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
65nfeq2 2929 . . . . . . . . . . . . . 14 𝑦(𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)
74, 6nfim 1977 . . . . . . . . . . . . 13 𝑦(suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
83, 7nfral 3094 . . . . . . . . . . . 12 𝑦𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
92, 8nfxfr 1929 . . . . . . . . . . 11 𝑦𝜓
109nf5ri 2219 . . . . . . . . . 10 (𝜓 → ∀𝑦𝜓)
11 bnj981.5 . . . . . . . . . 10 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
1210, 11bnj1096 31191 . . . . . . . . 9 (𝜒 → ∀𝑦𝜒)
1312nf5i 2179 . . . . . . . 8 𝑦𝜒
14 nfv 1995 . . . . . . . 8 𝑦 𝑖𝑛
15 nfv 1995 . . . . . . . 8 𝑦 𝑍 ∈ (𝑓𝑖)
1613, 14, 15nf3an 1983 . . . . . . 7 𝑦(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1716nfex 2318 . . . . . 6 𝑦𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1817nfex 2318 . . . . 5 𝑦𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
1918nfex 2318 . . . 4 𝑦𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))
201, 19nfim 1977 . . 3 𝑦(𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))
21 eleq1 2838 . . . 4 (𝑦 = 𝑍 → (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)))
22 eleq1 2838 . . . . . 6 (𝑦 = 𝑍 → (𝑦 ∈ (𝑓𝑖) ↔ 𝑍 ∈ (𝑓𝑖)))
23223anbi3d 1553 . . . . 5 (𝑦 = 𝑍 → ((𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ (𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
24233exbidv 2005 . . . 4 (𝑦 = 𝑍 → (∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
2521, 24imbi12d 333 . . 3 (𝑦 = 𝑍 → ((𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖))) ↔ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))))
26 bnj981.1 . . . 4 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
27 bnj981.3 . . . 4 𝐷 = (ω ∖ {∅})
28 bnj981.4 . . . 4 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
2926, 2, 27, 28, 11bnj917 31342 . . 3 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
3020, 25, 29vtoclg1f 3416 . 2 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖))))
3130pm2.43i 52 1 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝜒𝑖𝑛𝑍 ∈ (𝑓𝑖)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ w3a 1071   = wceq 1631  ∃wex 1852   ∈ wcel 2145  {cab 2757  ∀wral 3061  ∃wrex 3062   ∖ cdif 3720  ∅c0 4063  {csn 4316  ∪ ciun 4654  suc csuc 5868   Fn wfn 6026  ‘cfv 6031  ωcom 7212   ∧ w-bnj17 31092   predc-bnj14 31094   trClc-bnj18 31100 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-v 3353  df-iun 4656  df-fn 6034  df-bnj17 31093  df-bnj18 31101 This theorem is referenced by:  bnj1128  31396
 Copyright terms: Public domain W3C validator