Theorem harval3 43529

Description: (har‘𝐴) is the least cardinal that is greater than 𝐴. (Contributed by RP, 4-Nov-2023.)

Assertion

Ref	Expression
harval3	⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})

Distinct variable group:   𝑥,𝐴

Proof of Theorem harval3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		harval2 10016	. 2 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦})
2		vex 3468	. . . . . 6 ⊢ 𝑥 ∈ V
3	2	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ∈ V)
4		elrncard 43528	. . . . . . . . 9 ⊢ (𝑥 ∈ ran card ↔ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 ¬ 𝑦 ≈ 𝑥))
5	4	simplbi 497	. . . . . . . 8 ⊢ (𝑥 ∈ ran card → 𝑥 ∈ On)
6	5	anim1i 615	. . . . . . 7 ⊢ ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥))
7		eleq1 2823	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ On ↔ 𝑥 ∈ On))
8		breq2 5128	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝐴 ≺ 𝑦 ↔ 𝐴 ≺ 𝑥))
9	7, 8	anbi12d 632	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) ↔ (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥)))
10	6, 9	imbitrrid 246	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
11	10	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑦 = 𝑥) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
12		ssidd 3987	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ⊆ 𝑥)
13	3, 11, 12	intabssd 43510	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} ⊆ ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
14		vex 3468	. . . . . . 7 ⊢ 𝑦 ∈ V
15	14	inex1 5292	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ∈ V
16	15	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ∈ V)
17		oncardid 9975	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ≈ 𝑦)
18	17	ensymd 9024	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ≈ (card‘𝑦))
19		sdomentr 9130	. . . . . . . . . . . 12 ⊢ ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦))
20	19	a1i 11	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦)))
21	18, 20	mpan2d 694	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (𝐴 ≺ 𝑦 → 𝐴 ≺ (card‘𝑦)))
22		df-card 9958	. . . . . . . . . . . 12 ⊢ card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥})
23	22	funmpt2 6580	. . . . . . . . . . 11 ⊢ Fun card
24		onenon 9968	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ∈ dom card)
25		fvelrn 7071	. . . . . . . . . . 11 ⊢ ((Fun card ∧ 𝑦 ∈ dom card) → (card‘𝑦) ∈ ran card)
26	23, 24, 25	sylancr 587	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (card‘𝑦) ∈ ran card)
27	21, 26	jctild 525	. . . . . . . . 9 ⊢ (𝑦 ∈ On → (𝐴 ≺ 𝑦 → ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
28	27	adantl 481	. . . . . . . 8 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝐴 ≺ 𝑦 → ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
29		simpl 482	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → 𝑥 = (𝑦 ∩ (card‘𝑦)))
30		cardonle 9976	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ⊆ 𝑦)
31	30	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (card‘𝑦) ⊆ 𝑦)
32		sseqin2 4203	. . . . . . . . . . 11 ⊢ ((card‘𝑦) ⊆ 𝑦 ↔ (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
33	31, 32	sylib 218	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
34	29, 33	eqtrd 2771	. . . . . . . . 9 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → 𝑥 = (card‘𝑦))
35		eleq1 2823	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝑥 ∈ ran card ↔ (card‘𝑦) ∈ ran card))
36		breq2 5128	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ (card‘𝑦)))
37	35, 36	anbi12d 632	. . . . . . . . 9 ⊢ (𝑥 = (card‘𝑦) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) ↔ ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
38	34, 37	syl 17	. . . . . . . 8 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) ↔ ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
39	28, 38	sylibrd 259	. . . . . . 7 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝐴 ≺ 𝑦 → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
40	39	expimpd 453	. . . . . 6 ⊢ (𝑥 = (𝑦 ∩ (card‘𝑦)) → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
41	40	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑥 = (𝑦 ∩ (card‘𝑦))) → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
42		inss1 4217	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦
43	42	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦)
44	16, 41, 43	intabssd 43510	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)} ⊆ ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)})
45	13, 44	eqssd 3981	. . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
46		df-rab 3421	. . . 4 ⊢ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
47	46	inteqi 4931	. . 3 ⊢ ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
48		df-rab 3421	. . . 4 ⊢ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
49	48	inteqi 4931	. . 3 ⊢ ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
50	45, 47, 49	3eqtr4g 2796	. 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})
51	1, 50	eqtrd 2771	1 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2714  ∀wral 3052  {crab 3420  Vcvv 3464   ∩ cin 3930   ⊆ wss 3931  ∩ cint 4927   class class class wbr 5124  dom cdm 5659  ran crn 5660  Oncon0 6357  Fun wfun 6530  ‘cfv 6536   ≈ cen 8961   ≺ csdm 8963  harchar 9575  cardccrd 9954

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-er 8724  df-en 8965  df-dom 8966  df-sdom 8967  df-oi 9529  df-har 9576  df-card 9958

This theorem is referenced by:  harval3on  43530