Theorem tfrlem13 8319

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 8313	. . 3 ⊢ Ord dom recs(𝐹)
3		ordirr 6328	. . 3 ⊢ (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹))
4	2, 3	ax-mp 5	. 2 ⊢ ¬ dom recs(𝐹) ∈ dom recs(𝐹)
5		eqid 2739	. . . . 5 ⊢ (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) = (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩})
6	1, 5	tfrlem12 8318	. . . 4 ⊢ (recs(𝐹) ∈ V → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴)
7		elssuni 4869	. . . . 5 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ ∪ 𝐴)
8	1	recsfval 8310	. . . . 5 ⊢ recs(𝐹) = ∪ 𝐴
9	7, 8	sseqtrrdi 3956	. . . 4 ⊢ ((recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ∈ 𝐴 → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) ⊆ recs(𝐹))
10		dmss 5844	. . . 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 7841	. . . . . 6 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V)
14		elon2 6321	. . . . . 6 ⊢ (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V))
15	12, 13, 14	sylanbrc 589	. . . . 5 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On)
16		sucidg 6393	. . . . 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 8316	. . . . 5 ⊢ (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}) Fn suc dom recs(𝐹))
19		fndm 6588	. . . . 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 2842	. . 3 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {⟨dom recs(𝐹), (𝐹‘recs(𝐹))⟩}))
22	11, 21	sseldd 3916	. 2 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom recs(𝐹))
23	4, 22	mto 198	1 ⊢ ¬ recs(𝐹) ∈ V

Syntax hints:  ¬ wn 3   ∧ wa 396   = wceq 1547   ∈ wcel 2119  {cab 2717  ∀wral 3053  ∃wrex 3063  Vcvv 3431   ∪ cun 3881   ⊆ wss 3883  {csn 4555  ⟨cop 4561  ∪ cuni 4838  dom cdm 5618   ↾ cres 5620  Ord word 6309  Oncon0 6310  suc csuc 6312   Fn wfn 6480  ‘cfv 6485  recscrecs 8300

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fo 6491  df-fv 6493  df-ov 7359  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301

This theorem is referenced by:  tfrlem14  8320  tfrlem15  8321  tfrlem16  8322  tfr2b  8325