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

Theorem wfrlem3a 7362
 Description: Lemma for well-founded recursion. Show membership in the class of acceptable functions. (Contributed by Scott Fenton, 31-Jul-2020.)
Hypotheses
Ref Expression
wfrlem1.1 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
wfrlem3a.2 𝐺 ∈ V
Assertion
Ref Expression
wfrlem3a (𝐺𝐵 ↔ ∃𝑧(𝐺 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤)))))
Distinct variable groups:   𝐴,𝑓,𝑤,𝑥,𝑦,𝑧   𝑓,𝐹,𝑤,𝑥,𝑦,𝑧   𝑅,𝑓,𝑤,𝑥,𝑦,𝑧   𝑓,𝐺,𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑧,𝑤,𝑓)

Proof of Theorem wfrlem3a
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 wfrlem3a.2 . 2 𝐺 ∈ V
2 fneq1 5937 . . . 4 (𝑔 = 𝐺 → (𝑔 Fn 𝑧𝐺 Fn 𝑧))
3 fveq1 6147 . . . . . 6 (𝑔 = 𝐺 → (𝑔𝑤) = (𝐺𝑤))
4 reseq1 5350 . . . . . . 7 (𝑔 = 𝐺 → (𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)) = (𝐺 ↾ Pred(𝑅, 𝐴, 𝑤)))
54fveq2d 6152 . . . . . 6 (𝑔 = 𝐺 → (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤))))
63, 5eqeq12d 2636 . . . . 5 (𝑔 = 𝐺 → ((𝑔𝑤) = (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))) ↔ (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤)))))
76ralbidv 2980 . . . 4 (𝑔 = 𝐺 → (∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))) ↔ ∀𝑤𝑧 (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤)))))
82, 73anbi13d 1398 . . 3 (𝑔 = 𝐺 → ((𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))) ↔ (𝐺 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤))))))
98exbidv 1847 . 2 (𝑔 = 𝐺 → (∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))) ↔ ∃𝑧(𝐺 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤))))))
10 wfrlem1.1 . . 3 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
1110wfrlem1 7359 . 2 𝐵 = {𝑔 ∣ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐹‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))}
121, 9, 11elab2 3337 1 (𝐺𝐵 ↔ ∃𝑧(𝐺 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝐺𝑤) = (𝐹‘(𝐺 ↾ Pred(𝑅, 𝐴, 𝑤)))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480  ∃wex 1701   ∈ wcel 1987  {cab 2607  ∀wral 2907  Vcvv 3186   ⊆ wss 3555   ↾ cres 5076  Predcpred 5638   Fn wfn 5842  ‘cfv 5847 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-iota 5810  df-fun 5849  df-fn 5850  df-fv 5855 This theorem is referenced by:  wfrlem17  7376
 Copyright terms: Public domain W3C validator