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

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

Proof of Theorem bnj916
StepHypRef Expression
1 bnj256 33548 . . . . . 6 ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ (𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
212exbii 1851 . . . . 5 (∃𝑛𝑖(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑛𝑖((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ (𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
3 19.41v 1953 . . . . . 6 (∃𝑛((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))) ↔ (∃𝑛(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
4 nfv 1917 . . . . . . . . 9 𝑖 𝑛𝐷
5 bnj916.1 . . . . . . . . . . 11 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
6 bnj916.2 . . . . . . . . . . 11 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
75, 6bnj911 33774 . . . . . . . . . 10 ((𝑓 Fn 𝑛𝜑𝜓) → ∀𝑖(𝑓 Fn 𝑛𝜑𝜓))
87nf5i 2142 . . . . . . . . 9 𝑖(𝑓 Fn 𝑛𝜑𝜓)
94, 8nfan 1902 . . . . . . . 8 𝑖(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓))
10919.42 2229 . . . . . . 7 (∃𝑖((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ (𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
1110exbii 1850 . . . . . 6 (∃𝑛𝑖((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ (𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))) ↔ ∃𝑛((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
12 df-rex 3070 . . . . . . 7 (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ↔ ∃𝑛(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)))
13 df-rex 3070 . . . . . . 7 (∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖) ↔ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)))
1412, 13anbi12i 627 . . . . . 6 ((∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)) ↔ (∃𝑛(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))))
153, 11, 143bitr4i 302 . . . . 5 (∃𝑛𝑖((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓)) ∧ (𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖))) ↔ (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
162, 15bitri 274 . . . 4 (∃𝑛𝑖(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
1716exbii 1850 . . 3 (∃𝑓𝑛𝑖(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑓(∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
18 bnj916.5 . . . . . . 7 (𝜒 ↔ (𝑓 Fn 𝑛𝜑𝜓))
19183anbi2i 1158 . . . . . 6 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓) ↔ (𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓))
2019anbi1i 624 . . . . 5 (((𝑛𝐷𝜒𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓𝑖)) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓𝑖)))
21 df-bnj17 33529 . . . . 5 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓𝑖)))
22 df-bnj17 33529 . . . . 5 ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ((𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓𝑖)))
2320, 21, 223bitr4i 302 . . . 4 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)))
24233exbii 1852 . . 3 (∃𝑓𝑛𝑖(𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑓𝑛𝑖(𝑛𝐷 ∧ (𝑓 Fn 𝑛𝜑𝜓) ∧ 𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)))
25 bnj916.3 . . . . . . 7 𝐷 = (ω ∖ {∅})
26 bnj916.4 . . . . . . 7 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
275, 6, 25, 26bnj882 33768 . . . . . 6 trCl(𝑋, 𝐴, 𝑅) = 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖)
2827eleq2i 2824 . . . . 5 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑦 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖))
29 eliun 4994 . . . . 5 (𝑦 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ↔ ∃𝑓𝐵 𝑦 𝑖 ∈ dom 𝑓(𝑓𝑖))
30 eliun 4994 . . . . . 6 (𝑦 𝑖 ∈ dom 𝑓(𝑓𝑖) ↔ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖))
3130rexbii 3093 . . . . 5 (∃𝑓𝐵 𝑦 𝑖 ∈ dom 𝑓(𝑓𝑖) ↔ ∃𝑓𝐵𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖))
3228, 29, 313bitri 296 . . . 4 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓𝐵𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖))
33 df-rex 3070 . . . 4 (∃𝑓𝐵𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖) ↔ ∃𝑓(𝑓𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
3426eqabri 2876 . . . . . 6 (𝑓𝐵 ↔ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓))
3534anbi1i 624 . . . . 5 ((𝑓𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)) ↔ (∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
3635exbii 1850 . . . 4 (∃𝑓(𝑓𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)) ↔ ∃𝑓(∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
3732, 33, 363bitri 296 . . 3 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓(∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓𝑖)))
3817, 24, 373bitr4ri 303 . 2 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓𝑛𝑖(𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)))
39 bnj643 33591 . . . . . 6 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) → 𝜒)
4018bnj564 33586 . . . . . . 7 (𝜒 → dom 𝑓 = 𝑛)
4140eleq2d 2818 . . . . . 6 (𝜒 → (𝑖 ∈ dom 𝑓𝑖𝑛))
42 anbi1 632 . . . . . . 7 ((𝑖 ∈ dom 𝑓𝑖𝑛) → ((𝑖 ∈ dom 𝑓 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖))) ↔ (𝑖𝑛 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖)))))
43 bnj334 33555 . . . . . . . 8 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (𝑖 ∈ dom 𝑓𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖)))
44 bnj252 33545 . . . . . . . 8 ((𝑖 ∈ dom 𝑓𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖)) ↔ (𝑖 ∈ dom 𝑓 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖))))
4543, 44bitri 274 . . . . . . 7 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (𝑖 ∈ dom 𝑓 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖))))
46 bnj334 33555 . . . . . . . 8 ((𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ (𝑖𝑛𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖)))
47 bnj252 33545 . . . . . . . 8 ((𝑖𝑛𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖)) ↔ (𝑖𝑛 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖))))
4846, 47bitri 274 . . . . . . 7 ((𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)) ↔ (𝑖𝑛 ∧ (𝑛𝐷𝜒𝑦 ∈ (𝑓𝑖))))
4942, 45, 483bitr4g 313 . . . . . 6 ((𝑖 ∈ dom 𝑓𝑖𝑛) → ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖))))
5039, 41, 493syl 18 . . . . 5 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) → ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) ↔ (𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖))))
5150ibi 266 . . . 4 ((𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) → (𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
52512eximi 1838 . . 3 (∃𝑛𝑖(𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) → ∃𝑛𝑖(𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
5352eximi 1837 . 2 (∃𝑓𝑛𝑖(𝑛𝐷𝜒𝑖 ∈ dom 𝑓𝑦 ∈ (𝑓𝑖)) → ∃𝑓𝑛𝑖(𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
5438, 53sylbi 216 1 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓𝑛𝑖(𝑛𝐷𝜒𝑖𝑛𝑦 ∈ (𝑓𝑖)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wex 1781  wcel 2106  {cab 2708  wral 3060  wrex 3069  cdif 3941  c0 4318  {csn 4622   ciun 4990  dom cdm 5669  suc csuc 6355   Fn wfn 6527  cfv 6532  ωcom 7838  w-bnj17 33528   predc-bnj14 33530   trClc-bnj18 33536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2702
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-v 3475  df-iun 4992  df-fn 6535  df-bnj17 33529  df-bnj18 33537
This theorem is referenced by:  bnj917  33776
  Copyright terms: Public domain W3C validator