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 35692
Description: Technical lemma for bnj69 35752. 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 1951 . . . 4 Ⅎ𝑦 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)
2 bnj981.2 . . . . . . . . . . . 12 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3 nfcv 2929 . . . . . . . . . . . . 13 Ⅎ𝑦ω
4 nfv 1951 . . . . . . . . . . . . . 14 Ⅎ𝑦 suc 𝑖 ∈ 𝑛
5 nfiu1 4990 . . . . . . . . . . . . . . 15 Ⅎ𝑦∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
65nfeq2 2946 . . . . . . . . . . . . . 14 Ⅎ𝑦(𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)
74, 6nfim 1933 . . . . . . . . . . . . 13 Ⅎ𝑦(suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
83, 7nfralw 3313 . . . . . . . . . . . 12 Ⅎ𝑦∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
92, 8nfxfr 1888 . . . . . . . . . . 11 Ⅎ𝑦𝜓
109nf5ri 2238 . . . . . . . . . 10 (𝜓 → ∀𝑦𝜓)
11 bnj981.5 . . . . . . . . . 10 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
1210, 11bnj1096 35525 . . . . . . . . 9 (𝜒 → ∀𝑦𝜒)
1312nf5i 2189 . . . . . . . 8 Ⅎ𝑦𝜒
14 nfv 1951 . . . . . . . 8 Ⅎ𝑦 𝑖 ∈ 𝑛
15 nfv 1951 . . . . . . . 8 Ⅎ𝑦 𝑍 ∈ (𝑓‘𝑖)
1613, 14, 15nf3an 1938 . . . . . . 7 Ⅎ𝑦(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
1716nfex 2361 . . . . . 6 Ⅎ𝑦∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
1817nfex 2361 . . . . 5 Ⅎ𝑦∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
1918nfex 2361 . . . 4 Ⅎ𝑦∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))
201, 19nfim 1933 . . 3 Ⅎ𝑦(𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))
21 eleq1 2855 . . . 4 (𝑦 = 𝑍 → (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑍 ∈ trCl(𝑋, 𝐴, 𝑅)))
22 eleq1 2855 . . . . . 6 (𝑦 = 𝑍 → (𝑦 ∈ (𝑓‘𝑖) ↔ 𝑍 ∈ (𝑓‘𝑖)))
23223anbi3d 1473 . . . . 5 (𝑦 = 𝑍 → ((𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
24233exbidv 1962 . . . 4 (𝑦 = 𝑍 → (∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
2521, 24imbi12d 347 . . 3 (𝑦 = 𝑍 → ((𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))))
26 bnj981.1 . . . 4 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
27 bnj981.3 . . . 4 𝐷 = (ω ∖ {∅})
28 bnj981.4 . . . 4 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
2926, 2, 27, 28, 11bnj917 35676 . . 3 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
3020, 25, 29vtoclg1f 3533 . 2 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖))))
3130pm2.43i 53 1 (𝑍 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑍 ∈ (𝑓‘𝑖)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1104   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  ∀wral 3083  ∃wrex 3093   ∖ cdif 4047  ∅c0 4280  {csn 4587  ∪ ciun 4955  suc csuc 6389   Fn wfn 6560  ‘cfv 6565  ωcom 7910   ∧ w-bnj17 35429   predc-bnj14 35431   trClc-bnj18 35437
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-v 3455  df-iun 4957  df-fn 6568  df-bnj17 35430  df-bnj18 35438
This theorem is used by:  bnj1128  35732
  Copyright terms: Public domain W3C validator