MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frrlem4 Structured version   Visualization version   GIF version

Theorem frrlem4 8051
Description: Lemma for well-founded recursion. Properties of the restriction of an acceptable function to the domain of another acceptable function. (Contributed by Paul Chapman, 21-Apr-2012.)
Hypothesis
Ref Expression
frrlem4.1 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
Assertion
Ref Expression
frrlem4 ((𝑔𝐵𝐵) → ((𝑔 ↾ (dom 𝑔 ∩ dom )) Fn (dom 𝑔 ∩ dom ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )((𝑔 ↾ (dom 𝑔 ∩ dom ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)))))
Distinct variable groups:   𝐴,𝑎,𝑓,𝑔   𝐴,,𝑥,𝑦,𝑎   𝐵,𝑎   𝑓,,𝑥,𝑦   𝐺,𝑎,𝑓,𝑔   ,𝐺,𝑥,𝑦   𝑥,𝑔,𝑦   𝑅,𝑎,𝑓,𝑔   𝑅,,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑓,𝑔,)

Proof of Theorem frrlem4
Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frrlem4.1 . . . . . 6 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
21frrlem2 8049 . . . . 5 (𝑔𝐵 → Fun 𝑔)
32funfnd 6429 . . . 4 (𝑔𝐵𝑔 Fn dom 𝑔)
4 fnresin1 6521 . . . 4 (𝑔 Fn dom 𝑔 → (𝑔 ↾ (dom 𝑔 ∩ dom )) Fn (dom 𝑔 ∩ dom ))
53, 4syl 17 . . 3 (𝑔𝐵 → (𝑔 ↾ (dom 𝑔 ∩ dom )) Fn (dom 𝑔 ∩ dom ))
65adantr 484 . 2 ((𝑔𝐵𝐵) → (𝑔 ↾ (dom 𝑔 ∩ dom )) Fn (dom 𝑔 ∩ dom ))
71frrlem1 8048 . . . . . . . 8 𝐵 = {𝑔 ∣ ∃𝑏(𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))))}
87abeq2i 2873 . . . . . . 7 (𝑔𝐵 ↔ ∃𝑏(𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
9 fndm 6500 . . . . . . . . . . . 12 (𝑔 Fn 𝑏 → dom 𝑔 = 𝑏)
109adantr 484 . . . . . . . . . . 11 ((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏)) → dom 𝑔 = 𝑏)
1110raleqdv 3338 . . . . . . . . . 10 ((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏)) → (∀𝑎 ∈ dom 𝑔(𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))) ↔ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
1211biimp3ar 1472 . . . . . . . . 9 ((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) → ∀𝑎 ∈ dom 𝑔(𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))))
13 rsp 3128 . . . . . . . . 9 (∀𝑎 ∈ dom 𝑔(𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))) → (𝑎 ∈ dom 𝑔 → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
1412, 13syl 17 . . . . . . . 8 ((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) → (𝑎 ∈ dom 𝑔 → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
1514exlimiv 1938 . . . . . . 7 (∃𝑏(𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) → (𝑎 ∈ dom 𝑔 → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
168, 15sylbi 220 . . . . . 6 (𝑔𝐵 → (𝑎 ∈ dom 𝑔 → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))))
17 elinel1 4124 . . . . . 6 (𝑎 ∈ (dom 𝑔 ∩ dom ) → 𝑎 ∈ dom 𝑔)
1816, 17impel 509 . . . . 5 ((𝑔𝐵𝑎 ∈ (dom 𝑔 ∩ dom )) → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))))
1918adantlr 715 . . . 4 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))))
20 simpr 488 . . . . 5 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → 𝑎 ∈ (dom 𝑔 ∩ dom ))
2120fvresd 6756 . . . 4 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → ((𝑔 ↾ (dom 𝑔 ∩ dom ))‘𝑎) = (𝑔𝑎))
22 resres 5879 . . . . . 6 ((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)) = (𝑔 ↾ ((dom 𝑔 ∩ dom ) ∩ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)))
23 predss 6183 . . . . . . . . 9 Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎) ⊆ (dom 𝑔 ∩ dom )
24 sseqin2 4145 . . . . . . . . 9 (Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎) ⊆ (dom 𝑔 ∩ dom ) ↔ ((dom 𝑔 ∩ dom ) ∩ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)) = Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎))
2523, 24mpbi 233 . . . . . . . 8 ((dom 𝑔 ∩ dom ) ∩ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)) = Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)
261frrlem1 8048 . . . . . . . . . . . 12 𝐵 = { ∣ ∃𝑐( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))}
2726abeq2i 2873 . . . . . . . . . . 11 (𝐵 ↔ ∃𝑐( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎)))))
28 exdistrv 1964 . . . . . . . . . . . 12 (∃𝑏𝑐((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) ↔ (∃𝑏(𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ∃𝑐( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))))
29 inss1 4158 . . . . . . . . . . . . . . 15 (𝑏𝑐) ⊆ 𝑏
30 simpl2l 1228 . . . . . . . . . . . . . . 15 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → 𝑏𝐴)
3129, 30sstrid 3927 . . . . . . . . . . . . . 14 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → (𝑏𝑐) ⊆ 𝐴)
32 simp2r 1202 . . . . . . . . . . . . . . 15 ((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) → ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏)
33 simp2r 1202 . . . . . . . . . . . . . . 15 (( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎)))) → ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐)
34 nfra1 3141 . . . . . . . . . . . . . . . . 17 𝑎𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏
35 nfra1 3141 . . . . . . . . . . . . . . . . 17 𝑎𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐
3634, 35nfan 1907 . . . . . . . . . . . . . . . 16 𝑎(∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐)
37 elinel1 4124 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (𝑏𝑐) → 𝑎𝑏)
38 rsp 3128 . . . . . . . . . . . . . . . . . . 19 (∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 → (𝑎𝑏 → Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏))
3937, 38syl5com 31 . . . . . . . . . . . . . . . . . 18 (𝑎 ∈ (𝑏𝑐) → (∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 → Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏))
40 elinel2 4125 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (𝑏𝑐) → 𝑎𝑐)
41 rsp 3128 . . . . . . . . . . . . . . . . . . 19 (∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐 → (𝑎𝑐 → Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐))
4240, 41syl5com 31 . . . . . . . . . . . . . . . . . 18 (𝑎 ∈ (𝑏𝑐) → (∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐 → Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐))
4339, 42anim12d 612 . . . . . . . . . . . . . . . . 17 (𝑎 ∈ (𝑏𝑐) → ((∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) → (Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐)))
44 ssin 4160 . . . . . . . . . . . . . . . . . 18 ((Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ↔ Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))
4544biimpi 219 . . . . . . . . . . . . . . . . 17 ((Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) → Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))
4643, 45syl6com 37 . . . . . . . . . . . . . . . 16 ((∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) → (𝑎 ∈ (𝑏𝑐) → Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐)))
4736, 46ralrimi 3138 . . . . . . . . . . . . . . 15 ((∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) → ∀𝑎 ∈ (𝑏𝑐)Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))
4832, 33, 47syl2an 599 . . . . . . . . . . . . . 14 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → ∀𝑎 ∈ (𝑏𝑐)Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))
49 simpl1 1193 . . . . . . . . . . . . . . . 16 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → 𝑔 Fn 𝑏)
5049fndmd 6502 . . . . . . . . . . . . . . 15 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → dom 𝑔 = 𝑏)
51 simpr1 1196 . . . . . . . . . . . . . . . 16 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → Fn 𝑐)
5251fndmd 6502 . . . . . . . . . . . . . . 15 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → dom = 𝑐)
53 ineq12 4137 . . . . . . . . . . . . . . . . 17 ((dom 𝑔 = 𝑏 ∧ dom = 𝑐) → (dom 𝑔 ∩ dom ) = (𝑏𝑐))
5453sseq1d 3947 . . . . . . . . . . . . . . . 16 ((dom 𝑔 = 𝑏 ∧ dom = 𝑐) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ↔ (𝑏𝑐) ⊆ 𝐴))
5553sseq2d 3948 . . . . . . . . . . . . . . . . 17 ((dom 𝑔 = 𝑏 ∧ dom = 𝑐) → (Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom ) ↔ Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐)))
5653, 55raleqbidv 3326 . . . . . . . . . . . . . . . 16 ((dom 𝑔 = 𝑏 ∧ dom = 𝑐) → (∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom ) ↔ ∀𝑎 ∈ (𝑏𝑐)Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐)))
5754, 56anbi12d 634 . . . . . . . . . . . . . . 15 ((dom 𝑔 = 𝑏 ∧ dom = 𝑐) → (((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )) ↔ ((𝑏𝑐) ⊆ 𝐴 ∧ ∀𝑎 ∈ (𝑏𝑐)Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))))
5850, 52, 57syl2anc 587 . . . . . . . . . . . . . 14 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → (((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )) ↔ ((𝑏𝑐) ⊆ 𝐴 ∧ ∀𝑎 ∈ (𝑏𝑐)Pred(𝑅, 𝐴, 𝑎) ⊆ (𝑏𝑐))))
5931, 48, 58mpbir2and 713 . . . . . . . . . . . . 13 (((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )))
6059exlimivv 1940 . . . . . . . . . . . 12 (∃𝑏𝑐((𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )))
6128, 60sylbir 238 . . . . . . . . . . 11 ((∃𝑏(𝑔 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑎𝑏 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑏) ∧ ∀𝑎𝑏 (𝑔𝑎) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))) ∧ ∃𝑐( Fn 𝑐 ∧ (𝑐𝐴 ∧ ∀𝑎𝑐 Pred(𝑅, 𝐴, 𝑎) ⊆ 𝑐) ∧ ∀𝑎𝑐 (𝑎) = (𝑎𝐺( ↾ Pred(𝑅, 𝐴, 𝑎))))) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )))
628, 27, 61syl2anb 601 . . . . . . . . . 10 ((𝑔𝐵𝐵) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )))
6362adantr 484 . . . . . . . . 9 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → ((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )))
64 preddowncl 6208 . . . . . . . . 9 (((dom 𝑔 ∩ dom ) ⊆ 𝐴 ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )Pred(𝑅, 𝐴, 𝑎) ⊆ (dom 𝑔 ∩ dom )) → (𝑎 ∈ (dom 𝑔 ∩ dom ) → Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎) = Pred(𝑅, 𝐴, 𝑎)))
6563, 20, 64sylc 65 . . . . . . . 8 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎) = Pred(𝑅, 𝐴, 𝑎))
6625, 65eqtrid 2790 . . . . . . 7 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → ((dom 𝑔 ∩ dom ) ∩ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)) = Pred(𝑅, 𝐴, 𝑎))
6766reseq2d 5866 . . . . . 6 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → (𝑔 ↾ ((dom 𝑔 ∩ dom ) ∩ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎))) = (𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))
6822, 67eqtrid 2790 . . . . 5 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → ((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)) = (𝑔 ↾ Pred(𝑅, 𝐴, 𝑎)))
6968oveq2d 7248 . . . 4 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎))) = (𝑎𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑎))))
7019, 21, 693eqtr4d 2788 . . 3 (((𝑔𝐵𝐵) ∧ 𝑎 ∈ (dom 𝑔 ∩ dom )) → ((𝑔 ↾ (dom 𝑔 ∩ dom ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎))))
7170ralrimiva 3106 . 2 ((𝑔𝐵𝐵) → ∀𝑎 ∈ (dom 𝑔 ∩ dom )((𝑔 ↾ (dom 𝑔 ∩ dom ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎))))
726, 71jca 515 1 ((𝑔𝐵𝐵) → ((𝑔 ↾ (dom 𝑔 ∩ dom )) Fn (dom 𝑔 ∩ dom ) ∧ ∀𝑎 ∈ (dom 𝑔 ∩ dom )((𝑔 ↾ (dom 𝑔 ∩ dom ))‘𝑎) = (𝑎𝐺((𝑔 ↾ (dom 𝑔 ∩ dom )) ↾ Pred(𝑅, (dom 𝑔 ∩ dom ), 𝑎)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1089   = wceq 1543  wex 1787  wcel 2111  {cab 2715  wral 3062  cin 3880  wss 3881  dom cdm 5566  cres 5568  Predcpred 6175   Fn wfn 6393  cfv 6398  (class class class)co 7232
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2113  ax-9 2121  ax-10 2142  ax-12 2176  ax-ext 2709  ax-sep 5207  ax-nul 5214  ax-pr 5337
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2072  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3067  df-rex 3068  df-rab 3071  df-v 3423  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4253  df-if 4455  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4835  df-br 5069  df-opab 5131  df-xp 5572  df-rel 5573  df-cnv 5574  df-co 5575  df-dm 5576  df-rn 5577  df-res 5578  df-ima 5579  df-pred 6176  df-iota 6356  df-fun 6400  df-fn 6401  df-fv 6406  df-ov 7235
This theorem is referenced by:  fprlem1  8062  frrlem15  9398
  Copyright terms: Public domain W3C validator