Theorem hsmexlem5 10359

Description: Lemma for hsmex 10361. Combining the above constraints, along with itunitc 10350 and tcrank 9813, gives an effective constraint on the rank of 𝑆. (Contributed by Stefan O'Rear, 14-Feb-2015.)

Hypotheses

Ref	Expression
hsmexlem4.x	⊢ 𝑋 ∈ V
hsmexlem4.h	⊢ 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
hsmexlem4.u	⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
hsmexlem4.s	⊢ 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋}
hsmexlem4.o	⊢ 𝑂 = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐)))

Assertion

Ref	Expression
hsmexlem5	⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))

Distinct variable groups:   𝑎,𝑐,𝑑,𝐻   𝑆,𝑐,𝑑   𝑈,𝑐,𝑑   𝑎,𝑏,𝑧,𝑋   𝑥,𝑎,𝑦   𝑏,𝑐,𝑑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝑆(𝑥,𝑦,𝑧,𝑎,𝑏)   𝑈(𝑥,𝑦,𝑧,𝑎,𝑏)   𝐻(𝑥,𝑦,𝑧,𝑏)   𝑂(𝑥,𝑦,𝑧,𝑎,𝑏,𝑐,𝑑)   𝑋(𝑥,𝑦,𝑐,𝑑)

Proof of Theorem hsmexlem5

Step	Hyp	Ref	Expression
1		hsmexlem4.s	. . . . . . . 8 ⊢ 𝑆 = {𝑎 ∈ ∪ (𝑅1 “ On) ∣ ∀𝑏 ∈ (TC‘{𝑎})𝑏 ≼ 𝑋}
2	1	ssrab3 4041	. . . . . . 7 ⊢ 𝑆 ⊆ ∪ (𝑅1 “ On)
3	2	sseli 3939	. . . . . 6 ⊢ (𝑑 ∈ 𝑆 → 𝑑 ∈ ∪ (𝑅1 “ On))
4		tcrank 9813	. . . . . 6 ⊢ (𝑑 ∈ ∪ (𝑅1 “ On) → (rank‘𝑑) = (rank “ (TC‘𝑑)))
5	3, 4	syl 17	. . . . 5 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) = (rank “ (TC‘𝑑)))
6		hsmexlem4.u	. . . . . . . 8 ⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
7	6	itunitc 10350	. . . . . . 7 ⊢ (TC‘𝑑) = ∪ ran (𝑈‘𝑑)
8	6	itunifn 10346	. . . . . . . 8 ⊢ (𝑑 ∈ 𝑆 → (𝑈‘𝑑) Fn ω)
9		fniunfv 7203	. . . . . . . 8 ⊢ ((𝑈‘𝑑) Fn ω → ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐) = ∪ ran (𝑈‘𝑑))
10	8, 9	syl 17	. . . . . . 7 ⊢ (𝑑 ∈ 𝑆 → ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐) = ∪ ran (𝑈‘𝑑))
11	7, 10	eqtr4id 2783	. . . . . 6 ⊢ (𝑑 ∈ 𝑆 → (TC‘𝑑) = ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐))
12	11	imaeq2d 6020	. . . . 5 ⊢ (𝑑 ∈ 𝑆 → (rank “ (TC‘𝑑)) = (rank “ ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐)))
13		imaiun 7201	. . . . . 6 ⊢ (rank “ ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐)) = ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))
14	13	a1i 11	. . . . 5 ⊢ (𝑑 ∈ 𝑆 → (rank “ ∪ 𝑐 ∈ ω ((𝑈‘𝑑)‘𝑐)) = ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)))
15	5, 12, 14	3eqtrd 2768	. . . 4 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) = ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)))
16		dmresi 6012	. . . 4 ⊢ dom ( I ↾ ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) = ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))
17	15, 16	eqtr4di 2782	. . 3 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) = dom ( I ↾ ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))))
18		rankon 9724	. . . . . 6 ⊢ (rank‘𝑑) ∈ On
19	15, 18	eqeltrrdi 2837	. . . . 5 ⊢ (𝑑 ∈ 𝑆 → ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)) ∈ On)
20		eloni 6330	. . . . 5 ⊢ (∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)) ∈ On → Ord ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)))
21		oiid 9470	. . . . 5 ⊢ (Ord ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)) → OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) = ( I ↾ ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))))
22	19, 20, 21	3syl 18	. . . 4 ⊢ (𝑑 ∈ 𝑆 → OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) = ( I ↾ ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))))
23	22	dmeqd 5859	. . 3 ⊢ (𝑑 ∈ 𝑆 → dom OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) = dom ( I ↾ ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))))
24	17, 23	eqtr4d 2767	. 2 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) = dom OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))))
25		omex 9572	. . . 4 ⊢ ω ∈ V
26		wdomref 9501	. . . 4 ⊢ (ω ∈ V → ω ≼* ω)
27	25, 26	mp1i 13	. . 3 ⊢ (𝑑 ∈ 𝑆 → ω ≼* ω)
28		frfnom 8380	. . . . . . 7 ⊢ (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω) Fn ω
29		hsmexlem4.h	. . . . . . . 8 ⊢ 𝐻 = (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω)
30	29	fneq1i 6597	. . . . . . 7 ⊢ (𝐻 Fn ω ↔ (rec((𝑧 ∈ V ↦ (har‘𝒫 (𝑋 × 𝑧))), (har‘𝒫 𝑋)) ↾ ω) Fn ω)
31	28, 30	mpbir 231	. . . . . 6 ⊢ 𝐻 Fn ω
32		fniunfv 7203	. . . . . 6 ⊢ (𝐻 Fn ω → ∪ 𝑎 ∈ ω (𝐻‘𝑎) = ∪ ran 𝐻)
33	31, 32	ax-mp 5	. . . . 5 ⊢ ∪ 𝑎 ∈ ω (𝐻‘𝑎) = ∪ ran 𝐻
34		iunon 8285	. . . . . . 7 ⊢ ((ω ∈ V ∧ ∀𝑎 ∈ ω (𝐻‘𝑎) ∈ On) → ∪ 𝑎 ∈ ω (𝐻‘𝑎) ∈ On)
35	25, 34	mpan 690	. . . . . 6 ⊢ (∀𝑎 ∈ ω (𝐻‘𝑎) ∈ On → ∪ 𝑎 ∈ ω (𝐻‘𝑎) ∈ On)
36	29	hsmexlem9 10354	. . . . . 6 ⊢ (𝑎 ∈ ω → (𝐻‘𝑎) ∈ On)
37	35, 36	mprg 3050	. . . . 5 ⊢ ∪ 𝑎 ∈ ω (𝐻‘𝑎) ∈ On
38	33, 37	eqeltrri 2825	. . . 4 ⊢ ∪ ran 𝐻 ∈ On
39	38	a1i 11	. . 3 ⊢ (𝑑 ∈ 𝑆 → ∪ ran 𝐻 ∈ On)
40		fvssunirn 6873	. . . . . 6 ⊢ (𝐻‘𝑐) ⊆ ∪ ran 𝐻
41		hsmexlem4.x	. . . . . . . 8 ⊢ 𝑋 ∈ V
42		eqid 2729	. . . . . . . 8 ⊢ OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) = OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐)))
43	41, 29, 6, 1, 42	hsmexlem4 10358	. . . . . . 7 ⊢ ((𝑐 ∈ ω ∧ 𝑑 ∈ 𝑆) → dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ (𝐻‘𝑐))
44	43	ancoms 458	. . . . . 6 ⊢ ((𝑑 ∈ 𝑆 ∧ 𝑐 ∈ ω) → dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ (𝐻‘𝑐))
45	40, 44	sselid 3941	. . . . 5 ⊢ ((𝑑 ∈ 𝑆 ∧ 𝑐 ∈ ω) → dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ ∪ ran 𝐻)
46		imassrn 6031	. . . . . . 7 ⊢ (rank “ ((𝑈‘𝑑)‘𝑐)) ⊆ ran rank
47		rankf 9723	. . . . . . . 8 ⊢ rank:∪ (𝑅1 “ On)⟶On
48		frn 6677	. . . . . . . 8 ⊢ (rank:∪ (𝑅1 “ On)⟶On → ran rank ⊆ On)
49	47, 48	ax-mp 5	. . . . . . 7 ⊢ ran rank ⊆ On
50	46, 49	sstri 3953	. . . . . 6 ⊢ (rank “ ((𝑈‘𝑑)‘𝑐)) ⊆ On
51		ffun 6673	. . . . . . . 8 ⊢ (rank:∪ (𝑅1 “ On)⟶On → Fun rank)
52		fvex 6853	. . . . . . . . 9 ⊢ ((𝑈‘𝑑)‘𝑐) ∈ V
53	52	funimaex 6588	. . . . . . . 8 ⊢ (Fun rank → (rank “ ((𝑈‘𝑑)‘𝑐)) ∈ V)
54	47, 51, 53	mp2b 10	. . . . . . 7 ⊢ (rank “ ((𝑈‘𝑑)‘𝑐)) ∈ V
55	54	elpw 4563	. . . . . 6 ⊢ ((rank “ ((𝑈‘𝑑)‘𝑐)) ∈ 𝒫 On ↔ (rank “ ((𝑈‘𝑑)‘𝑐)) ⊆ On)
56	50, 55	mpbir 231	. . . . 5 ⊢ (rank “ ((𝑈‘𝑑)‘𝑐)) ∈ 𝒫 On
57	45, 56	jctil 519	. . . 4 ⊢ ((𝑑 ∈ 𝑆 ∧ 𝑐 ∈ ω) → ((rank “ ((𝑈‘𝑑)‘𝑐)) ∈ 𝒫 On ∧ dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ ∪ ran 𝐻))
58	57	ralrimiva 3125	. . 3 ⊢ (𝑑 ∈ 𝑆 → ∀𝑐 ∈ ω ((rank “ ((𝑈‘𝑑)‘𝑐)) ∈ 𝒫 On ∧ dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ ∪ ran 𝐻))
59		eqid 2729	. . . 4 ⊢ OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) = OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐)))
60	42, 59	hsmexlem3 10357	. . 3 ⊢ (((ω ≼* ω ∧ ∪ ran 𝐻 ∈ On) ∧ ∀𝑐 ∈ ω ((rank “ ((𝑈‘𝑑)‘𝑐)) ∈ 𝒫 On ∧ dom OrdIso( E , (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ ∪ ran 𝐻)) → dom OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))
61	27, 39, 58, 60	syl21anc 837	. 2 ⊢ (𝑑 ∈ 𝑆 → dom OrdIso( E , ∪ 𝑐 ∈ ω (rank “ ((𝑈‘𝑑)‘𝑐))) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))
62	24, 61	eqeltrd 2828	1 ⊢ (𝑑 ∈ 𝑆 → (rank‘𝑑) ∈ (har‘𝒫 (ω × ∪ ran 𝐻)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  {crab 3402  Vcvv 3444   ⊆ wss 3911  𝒫 cpw 4559  {csn 4585  ∪ cuni 4867  ∪ ciun 4951   class class class wbr 5102   ↦ cmpt 5183   I cid 5525   E cep 5530   × cxp 5629  dom cdm 5631  ran crn 5632   ↾ cres 5633   “ cima 5634  Ord word 6319  Oncon0 6320  Fun wfun 6493   Fn wfn 6494  ⟶wf 6495  ‘cfv 6499  ωcom 7822  reccrdg 8354   ≼ cdom 8893  OrdIsocoi 9438  harchar 9485   ≼^* cwdom 9493  TCctc 9665  𝑅₁cr1 9691  rankcrnk 9692

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-inf2 9570

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-isom 6508  df-riota 7326  df-ov 7372  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-smo 8292  df-recs 8317  df-rdg 8355  df-en 8896  df-dom 8897  df-sdom 8898  df-oi 9439  df-har 9486  df-wdom 9494  df-tc 9666  df-r1 9693  df-rank 9694

This theorem is referenced by:  hsmexlem6  10360