Theorem cantnflem4 9603

Description: Lemma for cantnf 9604. Complete the induction step of cantnflem3 9602. (Contributed by Mario Carneiro, 25-May-2015.)

Hypotheses

Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
oemapval.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
cantnf.c	⊢ (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
cantnf.s	⊢ (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
cantnf.e	⊢ (𝜑 → ∅ ∈ 𝐶)
cantnf.x	⊢ 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
cantnf.p	⊢ 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
cantnf.y	⊢ 𝑌 = (1st ‘𝑃)
cantnf.z	⊢ 𝑍 = (2nd ‘𝑃)

Assertion

Ref	Expression
cantnflem4	⊢ (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))

Distinct variable groups:   𝑤,𝑐,𝑥,𝑦,𝑧,𝐵   𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧,𝐶   𝐴,𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐   𝑆,𝑐,𝑥,𝑦,𝑧   𝑥,𝑍,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑤,𝑌,𝑥,𝑦,𝑧   𝑋,𝑎,𝑏,𝑑,𝑤,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑤,𝑎,𝑏,𝑐,𝑑)   𝐵(𝑎,𝑏,𝑑)   𝑃(𝑥,𝑦,𝑧,𝑤,𝑎,𝑏,𝑐,𝑑)   𝑆(𝑤,𝑎,𝑏,𝑑)   𝑇(𝑥,𝑦,𝑧,𝑤,𝑎,𝑏,𝑑)   𝑋(𝑐)   𝑌(𝑎,𝑏,𝑐,𝑑)   𝑍(𝑤,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem cantnflem4

Dummy variables 𝑔 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnf.s	. . . 4 ⊢ (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
2		cantnfs.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ On)
3		cantnfs.s	. . . . . . . . . . . . 13 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
4		cantnfs.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ On)
5		oemapval.t	. . . . . . . . . . . . 13 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
6		cantnf.c	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
7		cantnf.e	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∅ ∈ 𝐶)
8	3, 2, 4, 5, 6, 1, 7	cantnflem2 9601	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)))
9		eqid 2736	. . . . . . . . . . . . . 14 ⊢ 𝑋 = 𝑋
10		eqid 2736	. . . . . . . . . . . . . 14 ⊢ 𝑌 = 𝑌
11		eqid 2736	. . . . . . . . . . . . . 14 ⊢ 𝑍 = 𝑍
12	9, 10, 11	3pm3.2i 1340	. . . . . . . . . . . . 13 ⊢ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)
13		cantnf.x	. . . . . . . . . . . . . 14 ⊢ 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
14		cantnf.p	. . . . . . . . . . . . . 14 ⊢ 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
15		cantnf.y	. . . . . . . . . . . . . 14 ⊢ 𝑌 = (1st ‘𝑃)
16		cantnf.z	. . . . . . . . . . . . . 14 ⊢ 𝑍 = (2nd ‘𝑃)
17	13, 14, 15, 16	oeeui 8530	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → (((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶) ↔ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)))
18	12, 17	mpbiri 258	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
19	8, 18	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
20	19	simpld 494	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)))
21	20	simp1d 1142	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ On)
22		oecl 8464	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑o 𝑋) ∈ On)
23	2, 21, 22	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ∈ On)
24	20	simp2d 1143	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ (𝐴 ∖ 1o))
25	24	eldifad 3913	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
26		onelon 6342	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ On)
27	2, 25, 26	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ On)
28		omcl 8463	. . . . . . . 8 ⊢ (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
29	23, 27, 28	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
30	20	simp3d 1144	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ (𝐴 ↑o 𝑋))
31		onelon 6342	. . . . . . . 8 ⊢ (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → 𝑍 ∈ On)
32	23, 30, 31	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ On)
33		oaword1 8479	. . . . . . 7 ⊢ ((((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On ∧ 𝑍 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
34	29, 32, 33	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
35		dif1o 8427	. . . . . . . . . . 11 ⊢ (𝑌 ∈ (𝐴 ∖ 1o) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ≠ ∅))
36	35	simprbi 496	. . . . . . . . . 10 ⊢ (𝑌 ∈ (𝐴 ∖ 1o) → 𝑌 ≠ ∅)
37	24, 36	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ≠ ∅)
38		on0eln0 6374	. . . . . . . . . 10 ⊢ (𝑌 ∈ On → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
39	27, 38	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
40	37, 39	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ 𝑌)
41		omword1 8500	. . . . . . . 8 ⊢ ((((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) ∧ ∅ ∈ 𝑌) → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
42	23, 27, 40, 41	syl21anc 837	. . . . . . 7 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
43	42, 30	sseldd 3934	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ ((𝐴 ↑o 𝑋) ·o 𝑌))
44	34, 43	sseldd 3934	. . . . 5 ⊢ (𝜑 → 𝑍 ∈ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
45	19	simprd 495	. . . . 5 ⊢ (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶)
46	44, 45	eleqtrd 2838	. . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐶)
47	1, 46	sseldd 3934	. . 3 ⊢ (𝜑 → 𝑍 ∈ ran (𝐴 CNF 𝐵))
48	3, 2, 4	cantnff 9585	. . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵))
49		ffn 6662	. . . 4 ⊢ ((𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵) → (𝐴 CNF 𝐵) Fn 𝑆)
50		fvelrnb 6894	. . . 4 ⊢ ((𝐴 CNF 𝐵) Fn 𝑆 → (𝑍 ∈ ran (𝐴 CNF 𝐵) ↔ ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍))
51	48, 49, 50	3syl 18	. . 3 ⊢ (𝜑 → (𝑍 ∈ ran (𝐴 CNF 𝐵) ↔ ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍))
52	47, 51	mpbid 232	. 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑆 ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)
53	2	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐴 ∈ On)
54	4	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐵 ∈ On)
55	6	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ∈ (𝐴 ↑o 𝐵))
56	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
57	7	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → ∅ ∈ 𝐶)
58		simprl 770	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝑔 ∈ 𝑆)
59		simprr 772	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)
60		eqid 2736	. . 3 ⊢ (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝑔‘𝑡))) = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝑔‘𝑡)))
61	3, 53, 54, 5, 55, 56, 57, 13, 14, 15, 16, 58, 59, 60	cantnflem3 9602	. 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝑔) = 𝑍)) → 𝐶 ∈ ran (𝐴 CNF 𝐵))
62	52, 61	rexlimddv 3143	1 ⊢ (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∀wral 3051  ∃wrex 3060  {crab 3399   ∖ cdif 3898   ⊆ wss 3901  ∅c0 4285  ifcif 4479  ⟨cop 4586  ∪ cuni 4863  ∩ cint 4902  {copab 5160   ↦ cmpt 5179  dom cdm 5624  ran crn 5625  Oncon0 6317  ℩cio 6446   Fn wfn 6487  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  1^st c1st 7931  2^nd c2nd 7932  1_oc1o 8390  2_oc2o 8391   +_o coa 8394   ·_o comu 8395   ↑_o coe 8396   CNF ccnf 9572

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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-supp 8103  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-seqom 8379  df-1o 8397  df-2o 8398  df-oadd 8401  df-omul 8402  df-oexp 8403  df-er 8635  df-map 8767  df-en 8886  df-dom 8887  df-sdom 8888  df-fin 8889  df-fsupp 9267  df-oi 9417  df-cnf 9573

This theorem is referenced by:  cantnf  9604