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 35563
Description: Technical lemma for bnj69 35640. 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 35337 . . . . . 6 ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ (𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
212exbii 1881 . . . . 5 (∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑛∃𝑖((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ (𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
3 19.41v 1981 . . . . . 6 (∃𝑛((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ (∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
4 nfv 1946 . . . . . . . . 9 Ⅎ𝑖 𝑛 ∈ 𝐷
5 bnj916.1 . . . . . . . . . . 11 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
6 bnj916.2 . . . . . . . . . . 11 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
75, 6bnj911 35562 . . . . . . . . . 10 ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → ∀𝑖(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
87nf5i 2182 . . . . . . . . 9 Ⅎ𝑖(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)
94, 8nfan 1931 . . . . . . . 8 Ⅎ𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
10919.42 2272 . . . . . . 7 (∃𝑖((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ (𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
1110exbii 1880 . . . . . 6 (∃𝑛∃𝑖((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ (𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ ∃𝑛((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
12 df-rex 3087 . . . . . . 7 (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
13 df-rex 3087 . . . . . . 7 (∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖) ↔ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)))
1412, 13anbi12i 640 . . . . . 6 ((∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)) ↔ (∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ ∃𝑖(𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))))
153, 11, 143bitr4i 306 . . . . 5 (∃𝑛∃𝑖((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ (𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
162, 15bitri 278 . . . 4 (∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
1716exbii 1880 . . 3 (∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓(∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
18 bnj916.5 . . . . . . 7 (𝜒 ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
19183anbi2i 1176 . . . . . 6 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓))
2019anbi1i 636 . . . . 5 (((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓‘𝑖)))
21 df-bnj17 35318 . . . . 5 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓‘𝑖)))
22 df-bnj17 35318 . . . . 5 ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓) ∧ 𝑦 ∈ (𝑓‘𝑖)))
2320, 21, 223bitr4i 306 . . . 4 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)))
24233exbii 1882 . . 3 (∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)))
25 bnj916.3 . . . . . . 7 𝐷 = (ω ∖ {∅})
26 bnj916.4 . . . . . . 7 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
275, 6, 25, 26bnj882 35556 . . . . . 6 trCl(𝑋, 𝐴, 𝑅) = ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖)
2827eleq2i 2852 . . . . 5 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑦 ∈ ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖))
29 eliun 4954 . . . . 5 (𝑦 ∈ ∪ 𝑓 ∈ 𝐵 ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ↔ ∃𝑓 ∈ 𝐵 𝑦 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖))
30 eliun 4954 . . . . . 6 (𝑦 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ↔ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖))
3130rexbii 3109 . . . . 5 (∃𝑓 ∈ 𝐵 𝑦 ∈ ∪ 𝑖 ∈ dom 𝑓(𝑓‘𝑖) ↔ ∃𝑓 ∈ 𝐵 ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖))
3228, 29, 313bitri 300 . . . 4 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓 ∈ 𝐵 ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖))
33 df-rex 3087 . . . 4 (∃𝑓 ∈ 𝐵 ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖) ↔ ∃𝑓(𝑓 ∈ 𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
3426eqabri 2902 . . . . . 6 (𝑓 ∈ 𝐵 ↔ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
3534anbi1i 636 . . . . 5 ((𝑓 ∈ 𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)) ↔ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
3635exbii 1880 . . . 4 (∃𝑓(𝑓 ∈ 𝐵 ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓(∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
3732, 33, 363bitri 300 . . 3 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓(∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ ∃𝑖 ∈ dom 𝑓 𝑦 ∈ (𝑓‘𝑖)))
3817, 24, 373bitr4ri 307 . 2 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)))
39 bnj643 35380 . . . . . 6 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) → 𝜒)
4018bnj564 35375 . . . . . . 7 (𝜒 → dom 𝑓 = 𝑛)
4140eleq2d 2846 . . . . . 6 (𝜒 → (𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑛))
42 anbi1 645 . . . . . . 7 ((𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑛) → ((𝑖 ∈ dom 𝑓 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖))) ↔ (𝑖 ∈ 𝑛 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖)))))
43 bnj334 35344 . . . . . . . 8 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ dom 𝑓 ∧ 𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖)))
44 bnj252 35334 . . . . . . . 8 ((𝑖 ∈ dom 𝑓 ∧ 𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ dom 𝑓 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖))))
4543, 44bitri 278 . . . . . . 7 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ dom 𝑓 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖))))
46 bnj334 35344 . . . . . . . 8 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖)))
47 bnj252 35334 . . . . . . . 8 ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ 𝑛 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖))))
4846, 47bitri 278 . . . . . . 7 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑖 ∈ 𝑛 ∧ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑦 ∈ (𝑓‘𝑖))))
4942, 45, 483bitr4g 317 . . . . . 6 ((𝑖 ∈ dom 𝑓 ↔ 𝑖 ∈ 𝑛) → ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))))
5039, 41, 493syl 19 . . . . 5 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) → ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))))
5150ibi 270 . . . 4 ((𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) → (𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
52512eximi 1868 . . 3 (∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) → ∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
5352eximi 1867 . 2 (∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ dom 𝑓 ∧ 𝑦 ∈ (𝑓‘𝑖)) → ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
5438, 53sylbi 220 1 (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ 𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086   ∖ cdif 4045  ∅c0 4278  {csn 4583  ∪ ciun 4950  dom cdm 5650  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   trClc-bnj18 35325
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-v 3452  df-iun 4952  df-fn 6541  df-bnj17 35318  df-bnj18 35326
This theorem is used by:  bnj917  35564
  Copyright terms: Public domain W3C validator