cnfcom2lem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cnfcom2lem		Structured version Visualization version GIF version

Theorem cnfcom2lem 9698

Description: Lemma for cnfcom2 9699. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by AV, 3-Jul-2019.)

**Hypotheses**
Ref	Expression
cnfcom.s	⊢ 𝑆 = dom (ω CNF 𝐴)
cnfcom.a	⊢ (𝜑 → 𝐴 ∈ On)
cnfcom.b	⊢ (𝜑 → 𝐵 ∈ (ω ↑_o 𝐴))
cnfcom.f	⊢ 𝐹 = (^◡(ω CNF 𝐴)‘𝐵)
cnfcom.g	⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
cnfcom.h	⊢ 𝐻 = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +_o 𝑧)), ∅)
cnfcom.t	⊢ 𝑇 = seq_ω((𝑘 ∈ V, 𝑓 ∈ V ↦ 𝐾), ∅)
cnfcom.m	⊢ 𝑀 = ((ω ↑_o (𝐺‘𝑘)) ·_o (𝐹‘(𝐺‘𝑘)))
cnfcom.k	⊢ 𝐾 = ((𝑥 ∈ 𝑀 ↦ (dom 𝑓 +_o 𝑥)) ∪ ^◡(𝑥 ∈ dom 𝑓 ↦ (𝑀 +_o 𝑥)))
cnfcom.w	⊢ 𝑊 = (𝐺‘∪ dom 𝐺)
cnfcom2.1	⊢ (𝜑 → ∅ ∈ 𝐵)

**Assertion**
Ref	Expression
cnfcom2lem	⊢ (𝜑 → dom 𝐺 = suc ∪ dom 𝐺)

Distinct variable groups: 𝑥,𝑘,𝑧,𝐴 𝑥,𝑀 𝑓,𝑘,𝑥,𝑧,𝐹 𝑧,𝑇 𝑥,𝑊 𝑓,𝐺,𝑘,𝑥,𝑧 𝑓,𝐻,𝑥 𝑆,𝑘,𝑧 𝜑,𝑘,𝑥,𝑧 Allowed substitution hints: 𝜑(𝑓) 𝐴(𝑓) 𝐵(𝑥,𝑧,𝑓,𝑘) 𝑆(𝑥,𝑓) 𝑇(𝑥,𝑓,𝑘) 𝐻(𝑧,𝑘) 𝐾(𝑥,𝑧,𝑓,𝑘) 𝑀(𝑧,𝑓,𝑘) 𝑊(𝑧,𝑓,𝑘)

**Proof of Theorem cnfcom2lem**
Step	Hyp	Ref	Expression
1		cnfcom2.1	. . . . . 6 ⊢ (𝜑 → ∅ ∈ 𝐵)
2		n0i 4332	. . . . . 6 ⊢ (∅ ∈ 𝐵 → ¬ 𝐵 = ∅)
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → ¬ 𝐵 = ∅)
4		cnfcom.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (^◡(ω CNF 𝐴)‘𝐵)
5		cnfcom.s	. . . . . . . . . . . . . . . . 17 ⊢ 𝑆 = dom (ω CNF 𝐴)
6		omelon 9643	. . . . . . . . . . . . . . . . . 18 ⊢ ω ∈ On
7	6	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ω ∈ On)
8		cnfcom.a	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ∈ On)
9	5, 7, 8	cantnff1o 9693	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴))
10		f1ocnv 6844	. . . . . . . . . . . . . . . 16 ⊢ ((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴) → ^◡(ω CNF 𝐴):(ω ↑_o 𝐴)–1-1-onto→𝑆)
11		f1of 6832	. . . . . . . . . . . . . . . 16 ⊢ (^◡(ω CNF 𝐴):(ω ↑_o 𝐴)–1-1-onto→𝑆 → ^◡(ω CNF 𝐴):(ω ↑_o 𝐴)⟶𝑆)
12	9, 10, 11	3syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ^◡(ω CNF 𝐴):(ω ↑_o 𝐴)⟶𝑆)
13		cnfcom.b	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ∈ (ω ↑_o 𝐴))
14	12, 13	ffvelcdmd 7086	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (^◡(ω CNF 𝐴)‘𝐵) ∈ 𝑆)
15	4, 14	eqeltrid 2835	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
16	5, 7, 8	cantnfs 9663	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐴⟶ω ∧ 𝐹 finSupp ∅)))
17	15, 16	mpbid 231	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹:𝐴⟶ω ∧ 𝐹 finSupp ∅))
18	17	simpld 493	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐴⟶ω)
19	18	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹:𝐴⟶ω)
20	19	feqmptd 6959	. . . . . . . . 9 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
21		dif0 4371	. . . . . . . . . . . 12 ⊢ (𝐴 ∖ ∅) = 𝐴
22	21	eleq2i 2823	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ ∅) ↔ 𝑥 ∈ 𝐴)
23		simpr 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → dom 𝐺 = ∅)
24		ovexd 7446	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V)
25		cnfcom.g	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
26	5, 7, 8, 25, 15	cantnfcl 9664	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ( E We (𝐹 supp ∅) ∧ dom 𝐺 ∈ ω))
27	26	simpld 493	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → E We (𝐹 supp ∅))
28	25	oien 9535	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅))
29	24, 27, 28	syl2anc 582	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅))
30	29	adantr 479	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → dom 𝐺 ≈ (𝐹 supp ∅))
31	23, 30	eqbrtrrd 5171	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ∅ ≈ (𝐹 supp ∅))
32	31	ensymd 9003	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) ≈ ∅)
33		en0 9015	. . . . . . . . . . . . . 14 ⊢ ((𝐹 supp ∅) ≈ ∅ ↔ (𝐹 supp ∅) = ∅)
34	32, 33	sylib 217	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) = ∅)
35		ss0b 4396	. . . . . . . . . . . . 13 ⊢ ((𝐹 supp ∅) ⊆ ∅ ↔ (𝐹 supp ∅) = ∅)
36	34, 35	sylibr 233	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) ⊆ ∅)
37	8	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐴 ∈ On)
38		0ex 5306	. . . . . . . . . . . . 13 ⊢ ∅ ∈ V
39	38	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ∅ ∈ V)
40	19, 36, 37, 39	suppssr 8183	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ dom 𝐺 = ∅) ∧ 𝑥 ∈ (𝐴 ∖ ∅)) → (𝐹‘𝑥) = ∅)
41	22, 40	sylan2br 593	. . . . . . . . . 10 ⊢ (((𝜑 ∧ dom 𝐺 = ∅) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = ∅)
42	41	mpteq2dva 5247	. . . . . . . . 9 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ ∅))
43	20, 42	eqtrd 2770	. . . . . . . 8 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝑥 ∈ 𝐴 ↦ ∅))
44		fconstmpt 5737	. . . . . . . 8 ⊢ (𝐴 × {∅}) = (𝑥 ∈ 𝐴 ↦ ∅)
45	43, 44	eqtr4di 2788	. . . . . . 7 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝐴 × {∅}))
46	45	fveq2d 6894	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(𝐴 × {∅})))
47	4	fveq2i 6893	. . . . . . . 8 ⊢ ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵))
48		f1ocnvfv2 7277	. . . . . . . . 9 ⊢ (((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴) ∧ 𝐵 ∈ (ω ↑_o 𝐴)) → ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
49	9, 13, 48	syl2anc 582	. . . . . . . 8 ⊢ (𝜑 → ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
50	47, 49	eqtrid 2782	. . . . . . 7 ⊢ (𝜑 → ((ω CNF 𝐴)‘𝐹) = 𝐵)
51	50	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘𝐹) = 𝐵)
52		peano1 7881	. . . . . . . . 9 ⊢ ∅ ∈ ω
53	52	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ ω)
54	5, 7, 8, 53	cantnf0 9672	. . . . . . 7 ⊢ (𝜑 → ((ω CNF 𝐴)‘(𝐴 × {∅})) = ∅)
55	54	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘(𝐴 × {∅})) = ∅)
56	46, 51, 55	3eqtr3d 2778	. . . . 5 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐵 = ∅)
57	3, 56	mtand 812	. . . 4 ⊢ (𝜑 → ¬ dom 𝐺 = ∅)
58		nnlim 7871	. . . . 5 ⊢ (dom 𝐺 ∈ ω → ¬ Lim dom 𝐺)
59	26, 58	simpl2im 502	. . . 4 ⊢ (𝜑 → ¬ Lim dom 𝐺)
60		ioran 980	. . . 4 ⊢ (¬ (dom 𝐺 = ∅ ∨ Lim dom 𝐺) ↔ (¬ dom 𝐺 = ∅ ∧ ¬ Lim dom 𝐺))
61	57, 59, 60	sylanbrc 581	. . 3 ⊢ (𝜑 → ¬ (dom 𝐺 = ∅ ∨ Lim dom 𝐺))
62	25	oicl 9526	. . . 4 ⊢ Ord dom 𝐺
63		unizlim 6486	. . . 4 ⊢ (Ord dom 𝐺 → (dom 𝐺 = ∪ dom 𝐺 ↔ (dom 𝐺 = ∅ ∨ Lim dom 𝐺)))
64	62, 63	ax-mp 5	. . 3 ⊢ (dom 𝐺 = ∪ dom 𝐺 ↔ (dom 𝐺 = ∅ ∨ Lim dom 𝐺))
65	61, 64	sylnibr 328	. 2 ⊢ (𝜑 → ¬ dom 𝐺 = ∪ dom 𝐺)
66		orduniorsuc 7820	. . . 4 ⊢ (Ord dom 𝐺 → (dom 𝐺 = ∪ dom 𝐺 ∨ dom 𝐺 = suc ∪ dom 𝐺))
67	62, 66	mp1i 13	. . 3 ⊢ (𝜑 → (dom 𝐺 = ∪ dom 𝐺 ∨ dom 𝐺 = suc ∪ dom 𝐺))
68	67	ord 860	. 2 ⊢ (𝜑 → (¬ dom 𝐺 = ∪ dom 𝐺 → dom 𝐺 = suc ∪ dom 𝐺))
69	65, 68	mpd 15	1 ⊢ (𝜑 → dom 𝐺 = suc ∪ dom 𝐺)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 = wceq 1539 ∈ wcel 2104 Vcvv 3472 ∖ cdif 3944 ∪ cun 3945 ⊆ wss 3947 ∅c0 4321 {csn 4627 ∪ cuni 4907 class class class wbr 5147 ↦ cmpt 5230 E cep 5578 We wwe 5629 × cxp 5673 ^◡ccnv 5674 dom cdm 5675 Ord word 6362 Oncon0 6363 Lim wlim 6364 suc csuc 6365 ⟶wf 6538 –1-1-onto→wf1o 6541 ‘cfv 6542 (class class class)co 7411 ∈ cmpo 7413 ωcom 7857 supp csupp 8148 seq_ωcseqom 8449 +_o coa 8465 ·_o comu 8466 ↑_o coe 8467 ≈ cen 8938 finSupp cfsupp 9363 OrdIsocoi 9506 CNF ccnf 9658

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-inf2 9638

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-seqom 8450 df-1o 8468 df-2o 8469 df-oadd 8472 df-omul 8473 df-oexp 8474 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-oi 9507 df-cnf 9659

This theorem is referenced by: cnfcom2 9699 cnfcom3lem 9700 cnfcom3 9701

W3C validator