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

Theorem wfr1 8382
Description: The Principle of Well-Ordered Recursion, part 1 of 3. We start with an arbitrary function 𝐺. Then, using a base class 𝐴 and a set-like well-ordering 𝑅 of 𝐴, we define a function 𝐹. This function is said to be defined by "well-ordered recursion". The purpose of these three theorems is to demonstrate the properties of 𝐹. We begin by showing that 𝐹 is a function over 𝐴. (Contributed by Scott Fenton, 22-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) (Revised by Scott Fenton, 18-Nov-2024.)
Hypothesis
Ref Expression
wfr1.1 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
Assertion
Ref Expression
wfr1 ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 Fn 𝐴)

Proof of Theorem wfr1
StepHypRef Expression
1 wefr 5648 . . 3 (𝑅 We 𝐴 → 𝑅 Fr 𝐴)
21adantr 486 . 2 ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴)
3 weso 5649 . . . 4 (𝑅 We 𝐴 → 𝑅 Or 𝐴)
4 sopo 5585 . . . 4 (𝑅 Or 𝐴 → 𝑅 Po 𝐴)
53, 4syl 18 . . 3 (𝑅 We 𝐴 → 𝑅 Po 𝐴)
65adantr 486 . 2 ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴)
7 simpr 490 . 2 ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴)
8 wfr1.1 . . . 4 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
9 df-wrecs 8368 . . . 4 wrecs(𝑅, 𝐴, 𝐺) = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd ))
108, 9eqtri 2786 . . 3 𝐹 = frecs(𝑅, 𝐴, (𝐺 ∘ 2nd ))
1110fpr1 8359 . 2 ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 Fn 𝐴)
122, 6, 7, 11syl3anc 1399 1 ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 Fn 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   Po wpo 5564   Or wor 5565   Fr wfr 5608   Se wse 5609   We wwe 5610   ∘ ccom 5662   Fn wfn 6561  2nd c2nd 8034  frecscfrecs 8336  wrecscwrecs 8367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-frecs 8337  df-wrecs 8368
This theorem is used by:  wfr2  8383  wfr3  8384  tfr1ALT  8446  bpolylem  16258
  Copyright terms: Public domain W3C validator