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

Theorem bnj1500 32367
 Description: Well-founded recursion, part 2 of 3. The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1500.1 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1500.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1500.3 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
bnj1500.4 𝐹 = 𝐶
Assertion
Ref Expression
bnj1500 (𝑅 FrSe 𝐴 → ∀𝑥𝐴 (𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓,𝑥   𝑅,𝑑,𝑓,𝑥   𝑌,𝑑
Allowed substitution hints:   𝐵(𝑥,𝑑)   𝐶(𝑥,𝑓,𝑑)   𝐹(𝑥,𝑓,𝑑)   𝑌(𝑥,𝑓)

Proof of Theorem bnj1500
StepHypRef Expression
1 bnj1500.1 . 2 𝐵 = {𝑑 ∣ (𝑑𝐴 ∧ ∀𝑥𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
2 bnj1500.2 . 2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
3 bnj1500.3 . 2 𝐶 = {𝑓 ∣ ∃𝑑𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥𝑑 (𝑓𝑥) = (𝐺𝑌))}
4 bnj1500.4 . 2 𝐹 = 𝐶
5 biid 264 . 2 ((𝑅 FrSe 𝐴𝑥𝐴) ↔ (𝑅 FrSe 𝐴𝑥𝐴))
6 biid 264 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ 𝑓𝐶𝑥 ∈ dom 𝑓) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) ∧ 𝑓𝐶𝑥 ∈ dom 𝑓))
7 biid 264 . 2 ((((𝑅 FrSe 𝐴𝑥𝐴) ∧ 𝑓𝐶𝑥 ∈ dom 𝑓) ∧ 𝑑𝐵 ∧ dom 𝑓 = 𝑑) ↔ (((𝑅 FrSe 𝐴𝑥𝐴) ∧ 𝑓𝐶𝑥 ∈ dom 𝑓) ∧ 𝑑𝐵 ∧ dom 𝑓 = 𝑑))
81, 2, 3, 4, 5, 6, 7bnj1501 32366 1 (𝑅 FrSe 𝐴 → ∀𝑥𝐴 (𝐹𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2115  {cab 2802  ∀wral 3133  ∃wrex 3134   ⊆ wss 3919  ⟨cop 4556  ∪ cuni 4825  dom cdm 5543   ↾ cres 5545   Fn wfn 6339  ‘cfv 6344   predc-bnj14 31985   FrSe w-bnj15 31989 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5177  ax-sep 5190  ax-nul 5197  ax-pow 5254  ax-pr 5318  ax-un 7452  ax-reg 9049  ax-inf2 9097 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rab 3142  df-v 3482  df-sbc 3759  df-csb 3867  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-pss 3938  df-nul 4277  df-if 4451  df-pw 4524  df-sn 4551  df-pr 4553  df-tp 4555  df-op 4557  df-uni 4826  df-iun 4908  df-br 5054  df-opab 5116  df-mpt 5134  df-tr 5160  df-id 5448  df-eprel 5453  df-po 5462  df-so 5463  df-fr 5502  df-we 5504  df-xp 5549  df-rel 5550  df-cnv 5551  df-co 5552  df-dm 5553  df-rn 5554  df-res 5555  df-ima 5556  df-ord 6182  df-on 6183  df-lim 6184  df-suc 6185  df-iota 6303  df-fun 6346  df-fn 6347  df-f 6348  df-f1 6349  df-fo 6350  df-f1o 6351  df-fv 6352  df-om 7572  df-1o 8094  df-bnj17 31984  df-bnj14 31986  df-bnj13 31988  df-bnj15 31990  df-bnj18 31992  df-bnj19 31994 This theorem is referenced by:  bnj1523  32370
 Copyright terms: Public domain W3C validator