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

Theorem tfrlem14 8387
Description: Lemma for transfinite recursion. Assuming ax-rep 5284, 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 8386 . . 3 ¬ recs(𝐹) ∈ V
31tfrlem7 8379 . . . 4 Fun recs(𝐹)
4 funex 7217 . . . 4 ((Fun recs(𝐹) ∧ dom recs(𝐹) ∈ On) → recs(𝐹) ∈ V)
53, 4mpan 688 . . 3 (dom recs(𝐹) ∈ On → recs(𝐹) ∈ V)
62, 5mto 196 . 2 ¬ dom recs(𝐹) ∈ On
71tfrlem8 8380 . . 3 Ord dom recs(𝐹)
8 ordeleqon 7765 . . 3 (Ord dom recs(𝐹) ↔ (dom recs(𝐹) ∈ On ∨ dom recs(𝐹) = On))
97, 8mpbi 229 . 2 (dom recs(𝐹) ∈ On ∨ dom recs(𝐹) = On)
106, 9mtpor 1772 1 dom recs(𝐹) = On
Colors of variables: wff setvar class
Syntax hints:  wa 396  wo 845   = wceq 1541  wcel 2106  {cab 2709  wral 3061  wrex 3070  Vcvv 3474  dom cdm 5675  cres 5677  Ord word 6360  Oncon0 6361  Fun wfun 6534   Fn wfn 6535  cfv 6540  recscrecs 8366
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367
This theorem is referenced by:  tfr1  8393
  Copyright terms: Public domain W3C validator