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

Theorem tfrlem13 8312
Description: Lemma for transfinite recursion. If recs is a set function, then 𝐶 is acceptable, and thus a subset of recs, but dom 𝐶 is bigger than dom recs. This is a contradiction, so recs must be a proper class function. (Contributed by NM, 14-Aug-1994.) (Revised by Mario Carneiro, 14-Nov-2014.)
Hypothesis
Ref Expression
tfrlem.1 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
Assertion
Ref Expression
tfrlem13 ¬ recs(𝐹) ∈ V
Distinct variable group:   𝑥,𝑓,𝑦,𝐹
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑓)

Proof of Theorem tfrlem13
StepHypRef Expression
1 tfrlem.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐹‘(𝑓𝑦)))}
21tfrlem8 8306 . . 3 Ord dom recs(𝐹)
3 ordirr 6325 . . 3 (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹))
42, 3ax-mp 5 . 2 ¬ dom recs(𝐹) ∈ dom recs(𝐹)
5 eqid 2729 . . . . 5 (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩})
61, 5tfrlem12 8311 . . . 4 (recs(𝐹) ∈ V → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴)
7 elssuni 4888 . . . . 5 ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ 𝐴)
81recsfval 8303 . . . . 5 recs(𝐹) = 𝐴
97, 8sseqtrrdi 3977 . . . 4 ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹))
10 dmss 5845 . . . 4 ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹) → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ dom recs(𝐹))
116, 9, 103syl 18 . . 3 (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ dom recs(𝐹))
122a1i 11 . . . . . 6 (recs(𝐹) ∈ V → Ord dom recs(𝐹))
13 dmexg 7834 . . . . . 6 (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V)
14 elon2 6318 . . . . . 6 (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V))
1512, 13, 14sylanbrc 583 . . . . 5 (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On)
16 sucidg 6390 . . . . 5 (dom recs(𝐹) ∈ On → dom recs(𝐹) ∈ suc dom recs(𝐹))
1715, 16syl 17 . . . 4 (recs(𝐹) ∈ V → dom recs(𝐹) ∈ suc dom recs(𝐹))
181, 5tfrlem10 8309 . . . . 5 (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹))
19 fndm 6585 . . . . 5 ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹) → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = suc dom recs(𝐹))
2015, 18, 193syl 18 . . . 4 (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = suc dom recs(𝐹))
2117, 20eleqtrrd 2831 . . 3 (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}))
2211, 21sseldd 3936 . 2 (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom recs(𝐹))
234, 22mto 197 1 ¬ recs(𝐹) ∈ V
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1540  wcel 2109  {cab 2707  wral 3044  wrex 3053  Vcvv 3436  cun 3901  wss 3903  {csn 4577  cop 4583   cuni 4858  dom cdm 5619  cres 5621  Ord word 6306  Oncon0 6307  suc csuc 6309   Fn wfn 6477  cfv 6482  recscrecs 8293
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371  ax-un 7671
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-fo 6488  df-fv 6490  df-ov 7352  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294
This theorem is referenced by:  tfrlem14  8313  tfrlem15  8314  tfrlem16  8315  tfr2b  8318
  Copyright terms: Public domain W3C validator