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

Theorem tfrlem14 7351
Description: Lemma for transfinite recursion. Assuming ax-rep 4693, dom recs ∈ V ↔ recs ∈ V, so since dom recs is an ordinal, it must be equal to On. (Contributed by NM, 14-Aug-1994.) (Revised by Mario Carneiro, 9-May-2015.)
Hypothesis
Ref Expression
tfrlem.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
Assertion
Ref Expression
tfrlem14 dom recs(𝐹) = On
Distinct variable group:   𝑥,𝑓,𝑦,𝐹
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑓)

Proof of Theorem tfrlem14
StepHypRef Expression
1 tfrlem.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
21tfrlem13 7350 . . 3 ¬ recs(𝐹) ∈ V
31tfrlem7 7343 . . . 4 Fun recs(𝐹)
4 funex 6365 . . . 4 ((Fun recs(𝐹) ∧ dom recs(𝐹) ∈ On) → recs(𝐹) ∈ V)
53, 4mpan 701 . . 3 (dom recs(𝐹) ∈ On → recs(𝐹) ∈ V)
62, 5mto 186 . 2 ¬ dom recs(𝐹) ∈ On
71tfrlem8 7344 . . 3 Ord dom recs(𝐹)
8 ordeleqon 6857 . . 3 (Ord dom recs(𝐹) ↔ (dom recs(𝐹) ∈ On ∨ dom recs(𝐹) = On))
97, 8mpbi 218 . 2 (dom recs(𝐹) ∈ On ∨ dom recs(𝐹) = On)
106, 9mtpor 1685 1 dom recs(𝐹) = On
Colors of variables: wff setvar class
Syntax hints:  wo 381  wa 382   = wceq 1474  wcel 1976  {cab 2595  wral 2895  wrex 2896  Vcvv 3172  dom cdm 5028  cres 5030  Ord word 5625  Oncon0 5626  Fun wfun 5784   Fn wfn 5785  cfv 5790  recscrecs 7331
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2032  ax-13 2232  ax-ext 2589  ax-rep 4693  ax-sep 4703  ax-nul 4712  ax-pow 4764  ax-pr 4828  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-reu 2902  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-pss 3555  df-nul 3874  df-if 4036  df-sn 4125  df-pr 4127  df-tp 4129  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-tr 4675  df-eprel 4939  df-id 4943  df-po 4949  df-so 4950  df-fr 4987  df-we 4989  df-xp 5034  df-rel 5035  df-cnv 5036  df-co 5037  df-dm 5038  df-rn 5039  df-res 5040  df-ima 5041  df-pred 5583  df-ord 5629  df-on 5630  df-suc 5632  df-iota 5754  df-fun 5792  df-fn 5793  df-f 5794  df-f1 5795  df-fo 5796  df-f1o 5797  df-fv 5798  df-wrecs 7271  df-recs 7332
This theorem is referenced by:  tfr1  7357
  Copyright terms: Public domain W3C validator