Theorem tfrlem13 8026

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

Step	Hyp	Ref	Expression
1		tfrlem.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))}
2	1	tfrlem8 8020	. . 3 ⊢ Ord dom recs(𝐹)
3		ordirr 6209	. . 3 ⊢ (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹))
4	2, 3	ax-mp 5	. 2 ⊢ ¬ dom recs(𝐹) ∈ dom recs(𝐹)
5		eqid 2821	. . . . 5 ⊢ (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩})
6	1, 5	tfrlem12 8025	. . . 4 ⊢ (recs(𝐹) ∈ V → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴)
7		elssuni 4868	. . . . 5 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ ∪ 𝐴)
8	1	recsfval 8017	. . . . 5 ⊢ recs(𝐹) = ∪ 𝐴
9	7, 8	sseqtrrdi 4018	. . . 4 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹))
10		dmss 5771	. . . 4 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹) → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ dom recs(𝐹))
11	6, 9, 10	3syl 18	. . 3 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ dom recs(𝐹))
12	2	a1i 11	. . . . . 6 ⊢ (recs(𝐹) ∈ V → Ord dom recs(𝐹))
13		dmexg 7613	. . . . . 6 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V)
14		elon2 6202	. . . . . 6 ⊢ (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V))
15	12, 13, 14	sylanbrc 585	. . . . 5 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On)
16		sucidg 6269	. . . . 5 ⊢ (dom recs(𝐹) ∈ On → dom recs(𝐹) ∈ suc dom recs(𝐹))
17	15, 16	syl 17	. . . 4 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ suc dom recs(𝐹))
18	1, 5	tfrlem10 8023	. . . . 5 ⊢ (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹))
19		fndm 6455	. . . . 5 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹) → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = suc dom recs(𝐹))
20	15, 18, 19	3syl 18	. . . 4 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = suc dom recs(𝐹))
21	17, 20	eleqtrrd 2916	. . 3 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}))
22	11, 21	sseldd 3968	. 2 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom recs(𝐹))
23	4, 22	mto 199	1 ⊢ ¬ recs(𝐹) ∈ V

Syntax hints:  ¬ wn 3   ∧ wa 398   = wceq 1537   ∈ wcel 2114  {cab 2799  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ∪ cun 3934   ⊆ wss 3936  {csn 4567  ⟨cop 4573  ∪ cuni 4838  dom cdm 5555   ↾ cres 5557  Ord word 6190  Oncon0 6191  suc csuc 6193   Fn wfn 6350  ‘cfv 6355  recscrecs 8007

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-fv 6363  df-wrecs 7947  df-recs 8008

This theorem is referenced by:  tfrlem14  8027  tfrlem15  8028  tfrlem16  8029  tfr2b  8032