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 9770

Description: Lemma for cnfcom2 9771. (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 4363	. . . . . 6 ⊢ (∅ ∈ 𝐵 → ¬ 𝐵 = ∅)
3	1, 2	syl 17	. . . . 5 ⊢ (𝜑 → ¬ 𝐵 = ∅)
4		cnfcom.f	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (^◡(ω CNF 𝐴)‘𝐵)
5		cnfcom.s	. . . . . . . . . . . . . . . . 17 ⊢ 𝑆 = dom (ω CNF 𝐴)
6		omelon 9715	. . . . . . . . . . . . . . . . . 18 ⊢ ω ∈ On
7	6	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ω ∈ On)
8		cnfcom.a	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ∈ On)
9	5, 7, 8	cantnff1o 9765	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴))
10		f1ocnv 6874	. . . . . . . . . . . . . . . 16 ⊢ ((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴) → ^◡(ω CNF 𝐴):(ω ↑_o 𝐴)–1-1-onto→𝑆)
11		f1of 6862	. . . . . . . . . . . . . . . 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 7119	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (^◡(ω CNF 𝐴)‘𝐵) ∈ 𝑆)
15	4, 14	eqeltrid 2848	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
16	5, 7, 8	cantnfs 9735	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐴⟶ω ∧ 𝐹 finSupp ∅)))
17	15, 16	mpbid 232	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹:𝐴⟶ω ∧ 𝐹 finSupp ∅))
18	17	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝐴⟶ω)
19	18	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹:𝐴⟶ω)
20	19	feqmptd 6990	. . . . . . . . 9 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
21		dif0 4400	. . . . . . . . . . . 12 ⊢ (𝐴 ∖ ∅) = 𝐴
22	21	eleq2i 2836	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 ∖ ∅) ↔ 𝑥 ∈ 𝐴)
23		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → dom 𝐺 = ∅)
24		ovexd 7483	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐹 supp ∅) ∈ V)
25		cnfcom.g	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
26	5, 7, 8, 25, 15	cantnfcl 9736	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ( E We (𝐹 supp ∅) ∧ dom 𝐺 ∈ ω))
27	26	simpld 494	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → E We (𝐹 supp ∅))
28	25	oien 9607	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 supp ∅) ∈ V ∧ E We (𝐹 supp ∅)) → dom 𝐺 ≈ (𝐹 supp ∅))
29	24, 27, 28	syl2anc 583	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → dom 𝐺 ≈ (𝐹 supp ∅))
30	29	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → dom 𝐺 ≈ (𝐹 supp ∅))
31	23, 30	eqbrtrrd 5190	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ∅ ≈ (𝐹 supp ∅))
32	31	ensymd 9065	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) ≈ ∅)
33		en0 9078	. . . . . . . . . . . . . 14 ⊢ ((𝐹 supp ∅) ≈ ∅ ↔ (𝐹 supp ∅) = ∅)
34	32, 33	sylib 218	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) = ∅)
35		ss0b 4424	. . . . . . . . . . . . 13 ⊢ ((𝐹 supp ∅) ⊆ ∅ ↔ (𝐹 supp ∅) = ∅)
36	34, 35	sylibr 234	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝐹 supp ∅) ⊆ ∅)
37	8	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐴 ∈ On)
38		0ex 5325	. . . . . . . . . . . . 13 ⊢ ∅ ∈ V
39	38	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ∅ ∈ V)
40	19, 36, 37, 39	suppssr 8236	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ dom 𝐺 = ∅) ∧ 𝑥 ∈ (𝐴 ∖ ∅)) → (𝐹‘𝑥) = ∅)
41	22, 40	sylan2br 594	. . . . . . . . . 10 ⊢ (((𝜑 ∧ dom 𝐺 = ∅) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = ∅)
42	41	mpteq2dva 5266	. . . . . . . . 9 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ ∅))
43	20, 42	eqtrd 2780	. . . . . . . 8 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝑥 ∈ 𝐴 ↦ ∅))
44		fconstmpt 5762	. . . . . . . 8 ⊢ (𝐴 × {∅}) = (𝑥 ∈ 𝐴 ↦ ∅)
45	43, 44	eqtr4di 2798	. . . . . . 7 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐹 = (𝐴 × {∅}))
46	45	fveq2d 6924	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(𝐴 × {∅})))
47	4	fveq2i 6923	. . . . . . . 8 ⊢ ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵))
48		f1ocnvfv2 7313	. . . . . . . . 9 ⊢ (((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑_o 𝐴) ∧ 𝐵 ∈ (ω ↑_o 𝐴)) → ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
49	9, 13, 48	syl2anc 583	. . . . . . . 8 ⊢ (𝜑 → ((ω CNF 𝐴)‘(^◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
50	47, 49	eqtrid 2792	. . . . . . 7 ⊢ (𝜑 → ((ω CNF 𝐴)‘𝐹) = 𝐵)
51	50	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘𝐹) = 𝐵)
52		peano1 7927	. . . . . . . . 9 ⊢ ∅ ∈ ω
53	52	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ ω)
54	5, 7, 8, 53	cantnf0 9744	. . . . . . 7 ⊢ (𝜑 → ((ω CNF 𝐴)‘(𝐴 × {∅})) = ∅)
55	54	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → ((ω CNF 𝐴)‘(𝐴 × {∅})) = ∅)
56	46, 51, 55	3eqtr3d 2788	. . . . 5 ⊢ ((𝜑 ∧ dom 𝐺 = ∅) → 𝐵 = ∅)
57	3, 56	mtand 815	. . . 4 ⊢ (𝜑 → ¬ dom 𝐺 = ∅)
58		nnlim 7917	. . . . 5 ⊢ (dom 𝐺 ∈ ω → ¬ Lim dom 𝐺)
59	26, 58	simpl2im 503	. . . 4 ⊢ (𝜑 → ¬ Lim dom 𝐺)
60		ioran 984	. . . 4 ⊢ (¬ (dom 𝐺 = ∅ ∨ Lim dom 𝐺) ↔ (¬ dom 𝐺 = ∅ ∧ ¬ Lim dom 𝐺))
61	57, 59, 60	sylanbrc 582	. . 3 ⊢ (𝜑 → ¬ (dom 𝐺 = ∅ ∨ Lim dom 𝐺))
62	25	oicl 9598	. . . 4 ⊢ Ord dom 𝐺
63		unizlim 6518	. . . 4 ⊢ (Ord dom 𝐺 → (dom 𝐺 = ∪ dom 𝐺 ↔ (dom 𝐺 = ∅ ∨ Lim dom 𝐺)))
64	62, 63	ax-mp 5	. . 3 ⊢ (dom 𝐺 = ∪ dom 𝐺 ↔ (dom 𝐺 = ∅ ∨ Lim dom 𝐺))
65	61, 64	sylnibr 329	. 2 ⊢ (𝜑 → ¬ dom 𝐺 = ∪ dom 𝐺)
66		orduniorsuc 7866	. . . 4 ⊢ (Ord dom 𝐺 → (dom 𝐺 = ∪ dom 𝐺 ∨ dom 𝐺 = suc ∪ dom 𝐺))
67	62, 66	mp1i 13	. . 3 ⊢ (𝜑 → (dom 𝐺 = ∪ dom 𝐺 ∨ dom 𝐺 = suc ∪ dom 𝐺))
68	67	ord 863	. 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 206 ∧ wa 395 ∨ wo 846 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∖ cdif 3973 ∪ cun 3974 ⊆ wss 3976 ∅c0 4352 {csn 4648 ∪ cuni 4931 class class class wbr 5166 ↦ cmpt 5249 E cep 5598 We wwe 5651 × cxp 5698 ^◡ccnv 5699 dom cdm 5700 Ord word 6394 Oncon0 6395 Lim wlim 6396 suc csuc 6397 ⟶wf 6569 –1-1-onto→wf1o 6572 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 ωcom 7903 supp csupp 8201 seq_ωcseqom 8503 +_o coa 8519 ·_o comu 8520 ↑_o coe 8521 ≈ cen 9000 finSupp cfsupp 9431 OrdIsocoi 9578 CNF ccnf 9730

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-seqom 8504 df-1o 8522 df-2o 8523 df-oadd 8526 df-omul 8527 df-oexp 8528 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-oi 9579 df-cnf 9731

This theorem is referenced by: cnfcom2 9771 cnfcom3lem 9772 cnfcom3 9773

W3C validator