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

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

Proof of Theorem bnj1145
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 bnj1145.1 . . 3 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 bnj1145.2 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj1145.3 . . 3 𝐷 = (ω ∖ {∅})
4 bnj1145.4 . . 3 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
51, 2, 3, 4bnj882 30996 . 2 trCl(𝑋, 𝐴, 𝑅) = 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖)
6 ss2iun 4536 . . . 4 (∀𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝑓𝐵 𝐴)
7 bnj1145.5 . . . . . . 7 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
87, 4bnj1083 31046 . . . . . 6 (𝑓𝐵 ↔ ∃𝑛𝜒)
92bnj1095 30852 . . . . . . . . 9 (𝜓 → ∀𝑖𝜓)
109, 7bnj1096 30853 . . . . . . . 8 (𝜒 → ∀𝑖𝜒)
113bnj1098 30854 . . . . . . . . . . . . . . . . 17 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷) → (𝑗𝑛𝑖 = suc 𝑗))
127bnj1232 30874 . . . . . . . . . . . . . . . . . 18 (𝜒𝑛𝐷)
13123anim3i 1250 . . . . . . . . . . . . . . . . 17 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑖 ≠ ∅ ∧ 𝑖𝑛𝑛𝐷))
1411, 13bnj1101 30855 . . . . . . . . . . . . . . . 16 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑗𝑛𝑖 = suc 𝑗))
15 ancl 569 . . . . . . . . . . . . . . . 16 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑗𝑛𝑖 = suc 𝑗)) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ∧ (𝑗𝑛𝑖 = suc 𝑗))))
1614, 15bnj101 30789 . . . . . . . . . . . . . . 15 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ∧ (𝑗𝑛𝑖 = suc 𝑗)))
17 bnj1145.6 . . . . . . . . . . . . . . . . 17 (𝜃 ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ∧ (𝑗𝑛𝑖 = suc 𝑗)))
1817imbi2i 326 . . . . . . . . . . . . . . . 16 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝜃) ↔ ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ∧ (𝑗𝑛𝑖 = suc 𝑗))))
1918exbii 1774 . . . . . . . . . . . . . . 15 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝜃) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ∧ (𝑗𝑛𝑖 = suc 𝑗))))
2016, 19mpbir 221 . . . . . . . . . . . . . 14 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝜃)
21 bnj213 30952 . . . . . . . . . . . . . . . 16 pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
2221bnj226 30802 . . . . . . . . . . . . . . 15 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅) ⊆ 𝐴
23 simpr 477 . . . . . . . . . . . . . . . . . . 19 ((𝑗𝑛𝑖 = suc 𝑗) → 𝑖 = suc 𝑗)
2417, 23simplbiim 659 . . . . . . . . . . . . . . . . . 18 (𝜃𝑖 = suc 𝑗)
25 simp2 1062 . . . . . . . . . . . . . . . . . . . 20 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝑖𝑛)
26123ad2ant3 1084 . . . . . . . . . . . . . . . . . . . 20 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝑛𝐷)
273bnj923 30838 . . . . . . . . . . . . . . . . . . . . 21 (𝑛𝐷𝑛 ∈ ω)
28 elnn 7075 . . . . . . . . . . . . . . . . . . . . 21 ((𝑖𝑛𝑛 ∈ ω) → 𝑖 ∈ ω)
2927, 28sylan2 491 . . . . . . . . . . . . . . . . . . . 20 ((𝑖𝑛𝑛𝐷) → 𝑖 ∈ ω)
3025, 26, 29syl2anc 693 . . . . . . . . . . . . . . . . . . 19 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → 𝑖 ∈ ω)
3117, 30bnj832 30828 . . . . . . . . . . . . . . . . . 18 (𝜃𝑖 ∈ ω)
32 vex 3203 . . . . . . . . . . . . . . . . . . . 20 𝑗 ∈ V
3332bnj216 30800 . . . . . . . . . . . . . . . . . . 19 (𝑖 = suc 𝑗𝑗𝑖)
34 elnn 7075 . . . . . . . . . . . . . . . . . . 19 ((𝑗𝑖𝑖 ∈ ω) → 𝑗 ∈ ω)
3533, 34sylan 488 . . . . . . . . . . . . . . . . . 18 ((𝑖 = suc 𝑗𝑖 ∈ ω) → 𝑗 ∈ ω)
3624, 31, 35syl2anc 693 . . . . . . . . . . . . . . . . 17 (𝜃𝑗 ∈ ω)
3717, 25bnj832 30828 . . . . . . . . . . . . . . . . . 18 (𝜃𝑖𝑛)
3824, 37eqeltrrd 2702 . . . . . . . . . . . . . . . . 17 (𝜃 → suc 𝑗𝑛)
392bnj589 30979 . . . . . . . . . . . . . . . . . . . . . . 23 (𝜓 ↔ ∀𝑗 ∈ ω (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)))
4039biimpi 206 . . . . . . . . . . . . . . . . . . . . . 22 (𝜓 → ∀𝑗 ∈ ω (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)))
4140bnj708 30826 . . . . . . . . . . . . . . . . . . . . 21 ((𝑛𝐷𝑓 Fn 𝑛𝜑𝜓) → ∀𝑗 ∈ ω (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)))
42 rsp 2929 . . . . . . . . . . . . . . . . . . . . 21 (∀𝑗 ∈ ω (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)) → (𝑗 ∈ ω → (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))))
4341, 42syl 17 . . . . . . . . . . . . . . . . . . . 20 ((𝑛𝐷𝑓 Fn 𝑛𝜑𝜓) → (𝑗 ∈ ω → (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))))
447, 43sylbi 207 . . . . . . . . . . . . . . . . . . 19 (𝜒 → (𝑗 ∈ ω → (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))))
45443ad2ant3 1084 . . . . . . . . . . . . . . . . . 18 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑗 ∈ ω → (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))))
4617, 45bnj832 30828 . . . . . . . . . . . . . . . . 17 (𝜃 → (𝑗 ∈ ω → (suc 𝑗𝑛 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))))
4736, 38, 46mp2d 49 . . . . . . . . . . . . . . . 16 (𝜃 → (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))
48 fveq2 6191 . . . . . . . . . . . . . . . . . 18 (𝑖 = suc 𝑗 → (𝑓𝑖) = (𝑓‘suc 𝑗))
4948eqeq1d 2624 . . . . . . . . . . . . . . . . 17 (𝑖 = suc 𝑗 → ((𝑓𝑖) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)))
5024, 49syl 17 . . . . . . . . . . . . . . . 16 (𝜃 → ((𝑓𝑖) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅)))
5147, 50mpbird 247 . . . . . . . . . . . . . . 15 (𝜃 → (𝑓𝑖) = 𝑦 ∈ (𝑓𝑗) pred(𝑦, 𝐴, 𝑅))
5222, 51bnj1262 30881 . . . . . . . . . . . . . 14 (𝜃 → (𝑓𝑖) ⊆ 𝐴)
5320, 52bnj1023 30851 . . . . . . . . . . . . 13 𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴)
54 3anass 1042 . . . . . . . . . . . . . . 15 ((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) ↔ (𝑖 ≠ ∅ ∧ (𝑖𝑛𝜒)))
5554imbi1i 339 . . . . . . . . . . . . . 14 (((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴) ↔ ((𝑖 ≠ ∅ ∧ (𝑖𝑛𝜒)) → (𝑓𝑖) ⊆ 𝐴))
5655exbii 1774 . . . . . . . . . . . . 13 (∃𝑗((𝑖 ≠ ∅ ∧ 𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴) ↔ ∃𝑗((𝑖 ≠ ∅ ∧ (𝑖𝑛𝜒)) → (𝑓𝑖) ⊆ 𝐴))
5753, 56mpbi 220 . . . . . . . . . . . 12 𝑗((𝑖 ≠ ∅ ∧ (𝑖𝑛𝜒)) → (𝑓𝑖) ⊆ 𝐴)
581biimpi 206 . . . . . . . . . . . . . . 15 (𝜑 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
597, 58bnj771 30834 . . . . . . . . . . . . . 14 (𝜒 → (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
60 fveq2 6191 . . . . . . . . . . . . . . 15 (𝑖 = ∅ → (𝑓𝑖) = (𝑓‘∅))
61 bnj213 30952 . . . . . . . . . . . . . . . 16 pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴
62 sseq1 3626 . . . . . . . . . . . . . . . 16 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) → ((𝑓‘∅) ⊆ 𝐴 ↔ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐴))
6361, 62mpbiri 248 . . . . . . . . . . . . . . 15 ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) → (𝑓‘∅) ⊆ 𝐴)
64 sseq1 3626 . . . . . . . . . . . . . . . 16 ((𝑓𝑖) = (𝑓‘∅) → ((𝑓𝑖) ⊆ 𝐴 ↔ (𝑓‘∅) ⊆ 𝐴))
6564biimpar 502 . . . . . . . . . . . . . . 15 (((𝑓𝑖) = (𝑓‘∅) ∧ (𝑓‘∅) ⊆ 𝐴) → (𝑓𝑖) ⊆ 𝐴)
6660, 63, 65syl2an 494 . . . . . . . . . . . . . 14 ((𝑖 = ∅ ∧ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) → (𝑓𝑖) ⊆ 𝐴)
6759, 66sylan2 491 . . . . . . . . . . . . 13 ((𝑖 = ∅ ∧ 𝜒) → (𝑓𝑖) ⊆ 𝐴)
6867adantrl 752 . . . . . . . . . . . 12 ((𝑖 = ∅ ∧ (𝑖𝑛𝜒)) → (𝑓𝑖) ⊆ 𝐴)
6957, 68bnj1109 30857 . . . . . . . . . . 11 𝑗((𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴)
70 19.9v 1896 . . . . . . . . . . 11 (∃𝑗((𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴) ↔ ((𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴))
7169, 70mpbi 220 . . . . . . . . . 10 ((𝑖𝑛𝜒) → (𝑓𝑖) ⊆ 𝐴)
7271expcom 451 . . . . . . . . 9 (𝜒 → (𝑖𝑛 → (𝑓𝑖) ⊆ 𝐴))
73 fndm 5990 . . . . . . . . . . 11 (𝑓 Fn 𝑛 → dom 𝑓 = 𝑛)
747, 73bnj770 30833 . . . . . . . . . 10 (𝜒 → dom 𝑓 = 𝑛)
75 eleq2 2690 . . . . . . . . . . 11 (dom 𝑓 = 𝑛 → (𝑖 ∈ dom 𝑓𝑖𝑛))
7675imbi1d 331 . . . . . . . . . 10 (dom 𝑓 = 𝑛 → ((𝑖 ∈ dom 𝑓 → (𝑓𝑖) ⊆ 𝐴) ↔ (𝑖𝑛 → (𝑓𝑖) ⊆ 𝐴)))
7774, 76syl 17 . . . . . . . . 9 (𝜒 → ((𝑖 ∈ dom 𝑓 → (𝑓𝑖) ⊆ 𝐴) ↔ (𝑖𝑛 → (𝑓𝑖) ⊆ 𝐴)))
7872, 77mpbird 247 . . . . . . . 8 (𝜒 → (𝑖 ∈ dom 𝑓 → (𝑓𝑖) ⊆ 𝐴))
7910, 78hbralrimi 2954 . . . . . . 7 (𝜒 → ∀𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴)
8079exlimiv 1858 . . . . . 6 (∃𝑛𝜒 → ∀𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴)
818, 80sylbi 207 . . . . 5 (𝑓𝐵 → ∀𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴)
82 ss2iun 4536 . . . . . 6 (∀𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝑖 ∈ dom 𝑓 𝐴)
83 bnj1143 30861 . . . . . 6 𝑖 ∈ dom 𝑓 𝐴𝐴
8482, 83syl6ss 3615 . . . . 5 (∀𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴)
8581, 84syl 17 . . . 4 (𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴)
866, 85mprg 2926 . . 3 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝑓𝐵 𝐴
874bnj1317 30892 . . . 4 (𝑤𝐵 → ∀𝑓 𝑤𝐵)
8887bnj1146 30862 . . 3 𝑓𝐵 𝐴𝐴
8986, 88sstri 3612 . 2 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝐴
905, 89eqsstri 3635 1 trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wex 1704  wcel 1990  {cab 2608  wne 2794  wral 2912  wrex 2913  cdif 3571  wss 3574  c0 3915  {csn 4177   ciun 4520  dom cdm 5114  suc csuc 5725   Fn wfn 5883  cfv 5888  ωcom 7065  w-bnj17 30752   predc-bnj14 30754   trClc-bnj18 30760
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fn 5891  df-fv 5896  df-om 7066  df-bnj17 30753  df-bnj14 30755  df-bnj18 30761
This theorem is referenced by:  bnj1147  31062
  Copyright terms: Public domain W3C validator