Theorem cantnfvalf 9706

Description: Lemma for cantnf 9734. The function appearing in cantnfval 9709 is unconditionally a function. (Contributed by Mario Carneiro, 20-May-2015.)

Hypothesis

Ref	Expression
cantnfvalf.f	⊢ 𝐹 = seqω((𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷)), ∅)

Assertion

Ref	Expression
cantnfvalf	⊢ 𝐹:ω⟶On

Distinct variable groups:   𝑧,𝑘,𝐴   𝐵,𝑘,𝑧

Allowed substitution hints:   𝐶(𝑧,𝑘)   𝐷(𝑧,𝑘)   𝐹(𝑧,𝑘)

Proof of Theorem cantnfvalf

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnfvalf.f	. . 3 ⊢ 𝐹 = seqω((𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷)), ∅)
2	1	fnseqom 8496	. 2 ⊢ 𝐹 Fn ω
3		nn0suc 7917	. . . 4 ⊢ (𝑥 ∈ ω → (𝑥 = ∅ ∨ ∃𝑦 ∈ ω 𝑥 = suc 𝑦))
4		fveq2 6905	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐹‘𝑥) = (𝐹‘∅))
5		0ex 5306	. . . . . . . 8 ⊢ ∅ ∈ V
6	1	seqom0g 8497	. . . . . . . 8 ⊢ (∅ ∈ V → (𝐹‘∅) = ∅)
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ (𝐹‘∅) = ∅
8	4, 7	eqtrdi 2792	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐹‘𝑥) = ∅)
9		0elon 6437	. . . . . 6 ⊢ ∅ ∈ On
10	8, 9	eqeltrdi 2848	. . . . 5 ⊢ (𝑥 = ∅ → (𝐹‘𝑥) ∈ On)
11	1	seqomsuc 8498	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → (𝐹‘suc 𝑦) = (𝑦(𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))(𝐹‘𝑦)))
12		df-ov 7435	. . . . . . . . 9 ⊢ (𝑦(𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))(𝐹‘𝑦)) = ((𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))‘⟨𝑦, (𝐹‘𝑦)⟩)
13	11, 12	eqtrdi 2792	. . . . . . . 8 ⊢ (𝑦 ∈ ω → (𝐹‘suc 𝑦) = ((𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))‘⟨𝑦, (𝐹‘𝑦)⟩))
14		df-ov 7435	. . . . . . . . . . . 12 ⊢ (𝐶 +o 𝐷) = ( +o ‘⟨𝐶, 𝐷⟩)
15		fnoa 8547	. . . . . . . . . . . . . 14 ⊢ +o Fn (On × On)
16		oacl 8574	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 +o 𝑦) ∈ On)
17	16	rgen2 3198	. . . . . . . . . . . . . 14 ⊢ ∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥 +o 𝑦) ∈ On
18		ffnov 7560	. . . . . . . . . . . . . 14 ⊢ ( +o :(On × On)⟶On ↔ ( +o Fn (On × On) ∧ ∀𝑥 ∈ On ∀𝑦 ∈ On (𝑥 +o 𝑦) ∈ On))
19	15, 17, 18	mpbir2an 711	. . . . . . . . . . . . 13 ⊢ +o :(On × On)⟶On
20	19, 9	f0cli 7117	. . . . . . . . . . . 12 ⊢ ( +o ‘⟨𝐶, 𝐷⟩) ∈ On
21	14, 20	eqeltri 2836	. . . . . . . . . . 11 ⊢ (𝐶 +o 𝐷) ∈ On
22	21	rgen2w 3065	. . . . . . . . . 10 ⊢ ∀𝑘 ∈ 𝐴 ∀𝑧 ∈ 𝐵 (𝐶 +o 𝐷) ∈ On
23		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷)) = (𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))
24	23	fmpo 8094	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ 𝐴 ∀𝑧 ∈ 𝐵 (𝐶 +o 𝐷) ∈ On ↔ (𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷)):(𝐴 × 𝐵)⟶On)
25	22, 24	mpbi 230	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷)):(𝐴 × 𝐵)⟶On
26	25, 9	f0cli 7117	. . . . . . . 8 ⊢ ((𝑘 ∈ 𝐴, 𝑧 ∈ 𝐵 ↦ (𝐶 +o 𝐷))‘⟨𝑦, (𝐹‘𝑦)⟩) ∈ On
27	13, 26	eqeltrdi 2848	. . . . . . 7 ⊢ (𝑦 ∈ ω → (𝐹‘suc 𝑦) ∈ On)
28		fveq2 6905	. . . . . . . 8 ⊢ (𝑥 = suc 𝑦 → (𝐹‘𝑥) = (𝐹‘suc 𝑦))
29	28	eleq1d 2825	. . . . . . 7 ⊢ (𝑥 = suc 𝑦 → ((𝐹‘𝑥) ∈ On ↔ (𝐹‘suc 𝑦) ∈ On))
30	27, 29	syl5ibrcom 247	. . . . . 6 ⊢ (𝑦 ∈ ω → (𝑥 = suc 𝑦 → (𝐹‘𝑥) ∈ On))
31	30	rexlimiv 3147	. . . . 5 ⊢ (∃𝑦 ∈ ω 𝑥 = suc 𝑦 → (𝐹‘𝑥) ∈ On)
32	10, 31	jaoi 857	. . . 4 ⊢ ((𝑥 = ∅ ∨ ∃𝑦 ∈ ω 𝑥 = suc 𝑦) → (𝐹‘𝑥) ∈ On)
33	3, 32	syl 17	. . 3 ⊢ (𝑥 ∈ ω → (𝐹‘𝑥) ∈ On)
34	33	rgen 3062	. 2 ⊢ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ On
35		ffnfv 7138	. 2 ⊢ (𝐹:ω⟶On ↔ (𝐹 Fn ω ∧ ∀𝑥 ∈ ω (𝐹‘𝑥) ∈ On))
36	2, 34, 35	mpbir2an 711	1 ⊢ 𝐹:ω⟶On

Syntax hints:   ∨ wo 847   = wceq 1539   ∈ wcel 2107  ∀wral 3060  ∃wrex 3069  Vcvv 3479  ∅c0 4332  ⟨cop 4631   × cxp 5682  Oncon0 6383  suc csuc 6385   Fn wfn 6555  ⟶wf 6556  ‘cfv 6560  (class class class)co 7432   ∈ cmpo 7434  ωcom 7888  seq_ωcseqom 8488   +_o coa 8504

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pr 5431  ax-un 7756

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-seqom 8489  df-oadd 8511

This theorem is referenced by:  cantnfval2  9710  cantnfle  9712  cantnflt  9713  cantnflem1d  9729  cantnflem1  9730  cnfcomlem  9740