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

Theorem frrlem1 8285
Description: Lemma for well-founded recursion. The final item we are interested in is the union of acceptable functions 𝐵. This lemma just changes bound variables for later use. (Contributed by Paul Chapman, 21-Apr-2012.)
Hypothesis
Ref Expression
frrlem1.1 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
Assertion
Ref Expression
frrlem1 𝐵 = {𝑔 ∣ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))}
Distinct variable groups:   𝐴,𝑓,𝑔,𝑤,𝑥,𝑦,𝑧   𝑓,𝐺,𝑔,𝑤,𝑥,𝑦,𝑧   𝑅,𝑓,𝑔,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑧,𝑤,𝑓,𝑔)

Proof of Theorem frrlem1
StepHypRef Expression
1 frrlem1.1 . 2 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
2 fneq1 6639 . . . . . 6 (𝑓 = 𝑔 → (𝑓 Fn 𝑥𝑔 Fn 𝑥))
3 fveq1 6890 . . . . . . . 8 (𝑓 = 𝑔 → (𝑓𝑦) = (𝑔𝑦))
4 reseq1 5973 . . . . . . . . 9 (𝑓 = 𝑔 → (𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))
54oveq2d 7430 . . . . . . . 8 (𝑓 = 𝑔 → (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))))
63, 5eqeq12d 2743 . . . . . . 7 (𝑓 = 𝑔 → ((𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))))
76ralbidv 3172 . . . . . 6 (𝑓 = 𝑔 → (∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ ∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))))
82, 73anbi13d 1435 . . . . 5 (𝑓 = 𝑔 → ((𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (𝑔 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))))))
98exbidv 1917 . . . 4 (𝑓 = 𝑔 → (∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ∃𝑥(𝑔 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))))))
10 fneq2 6640 . . . . . 6 (𝑥 = 𝑧 → (𝑔 Fn 𝑥𝑔 Fn 𝑧))
11 sseq1 4003 . . . . . . 7 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝐴))
12 sseq2 4004 . . . . . . . . 9 (𝑥 = 𝑧 → (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥 ↔ Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑧))
1312raleqbi1dv 3328 . . . . . . . 8 (𝑥 = 𝑧 → (∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥 ↔ ∀𝑦𝑧 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑧))
14 predeq3 6303 . . . . . . . . . 10 (𝑦 = 𝑤 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑤))
1514sseq1d 4009 . . . . . . . . 9 (𝑦 = 𝑤 → (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑧 ↔ Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧))
1615cbvralvw 3229 . . . . . . . 8 (∀𝑦𝑧 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑧 ↔ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧)
1713, 16bitrdi 287 . . . . . . 7 (𝑥 = 𝑧 → (∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥 ↔ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧))
1811, 17anbi12d 630 . . . . . 6 (𝑥 = 𝑧 → ((𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ↔ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧)))
19 raleq 3317 . . . . . . 7 (𝑥 = 𝑧 → (∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ ∀𝑦𝑧 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))))
20 fveq2 6891 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑔𝑦) = (𝑔𝑤))
21 id 22 . . . . . . . . . 10 (𝑦 = 𝑤𝑦 = 𝑤)
2214reseq2d 5979 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))
2321, 22oveq12d 7432 . . . . . . . . 9 (𝑦 = 𝑤 → (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))
2420, 23eqeq12d 2743 . . . . . . . 8 (𝑦 = 𝑤 → ((𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))))
2524cbvralvw 3229 . . . . . . 7 (∀𝑦𝑧 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))
2619, 25bitrdi 287 . . . . . 6 (𝑥 = 𝑧 → (∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))))
2710, 18, 263anbi123d 1433 . . . . 5 (𝑥 = 𝑧 → ((𝑔 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ (𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))))
2827cbvexvw 2033 . . . 4 (∃𝑥(𝑔 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑔𝑦) = (𝑦𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))))
299, 28bitrdi 287 . . 3 (𝑓 = 𝑔 → (∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))))
3029cbvabv 2800 . 2 {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑔 ∣ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))}
311, 30eqtri 2755 1 𝐵 = {𝑔 ∣ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝑤𝐺(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))}
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1085   = wceq 1534  wex 1774  {cab 2704  wral 3056  wss 3944  cres 5674  Predcpred 6298   Fn wfn 6537  cfv 6542  (class class class)co 7414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2698
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5143  df-opab 5205  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6299  df-iota 6494  df-fun 6544  df-fn 6545  df-fv 6550  df-ov 7417
This theorem is referenced by:  frrlem2  8286  frrlem3  8287  frrlem4  8288  frrlem8  8292  frrlem12  8296  frrlem13  8297  fpr1  8302  fprresex  8309  frr1  9774  frr2  9775
  Copyright terms: Public domain W3C validator