Theorem tfrlem13 8028

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 8022	. . 3 ⊢ Ord dom recs(𝐹)
3		ordirr 6211	. . 3 ⊢ (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹))
4	2, 3	ax-mp 5	. 2 ⊢ ¬ dom recs(𝐹) ∈ dom recs(𝐹)
5		eqid 2823	. . . . 5 ⊢ (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩})
6	1, 5	tfrlem12 8027	. . . 4 ⊢ (recs(𝐹) ∈ V → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴)
7		elssuni 4870	. . . . 5 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ ∪ 𝐴)
8	1	recsfval 8019	. . . . 5 ⊢ recs(𝐹) = ∪ 𝐴
9	7, 8	sseqtrrdi 4020	. . . 4 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹))
10		dmss 5773	. . . 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 7615	. . . . . 6 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V)
14		elon2 6204	. . . . . 6 ⊢ (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V))
15	12, 13, 14	sylanbrc 585	. . . . 5 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On)
16		sucidg 6271	. . . . 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 8025	. . . . 5 ⊢ (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹))
19		fndm 6457	. . . . 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 2918	. . 3 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}))
22	11, 21	sseldd 3970	. 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 2801  ∀wral 3140  ∃wrex 3141  Vcvv 3496   ∪ cun 3936   ⊆ wss 3938  {csn 4569  ⟨cop 4575  ∪ cuni 4840  dom cdm 5557   ↾ cres 5559  Ord word 6192  Oncon0 6193  suc csuc 6195   Fn wfn 6352  ‘cfv 6357  recscrecs 8009

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 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

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 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-fv 6365  df-wrecs 7949  df-recs 8010

This theorem is referenced by:  tfrlem14  8029  tfrlem15  8030  tfrlem16  8031  tfr2b  8034