Theorem harval3 43894

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 9921	. 2 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦})
2		vex 3446	. . . . . 6 ⊢ 𝑥 ∈ V
3	2	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ∈ V)
4		elrncard 43893	. . . . . . . . 9 ⊢ (𝑥 ∈ ran card ↔ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 ¬ 𝑦 ≈ 𝑥))
5	4	simplbi 496	. . . . . . . 8 ⊢ (𝑥 ∈ ran card → 𝑥 ∈ On)
6	5	anim1i 616	. . . . . . 7 ⊢ ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥))
7		eleq1 2825	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ On ↔ 𝑥 ∈ On))
8		breq2 5104	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝐴 ≺ 𝑦 ↔ 𝐴 ≺ 𝑥))
9	7, 8	anbi12d 633	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) ↔ (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥)))
10	6, 9	imbitrrid 246	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
11	10	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑦 = 𝑥) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
12		ssidd 3959	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ⊆ 𝑥)
13	3, 11, 12	intabssd 43875	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} ⊆ ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
14		vex 3446	. . . . . . 7 ⊢ 𝑦 ∈ V
15	14	inex1 5264	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ∈ V
16	15	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ∈ V)
17		oncardid 9880	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ≈ 𝑦)
18	17	ensymd 8954	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ≈ (card‘𝑦))
19		sdomentr 9051	. . . . . . . . . . . 12 ⊢ ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦))
20	19	a1i 11	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦)))
21	18, 20	mpan2d 695	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (𝐴 ≺ 𝑦 → 𝐴 ≺ (card‘𝑦)))
22		df-card 9863	. . . . . . . . . . . 12 ⊢ card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥})
23	22	funmpt2 6539	. . . . . . . . . . 11 ⊢ Fun card
24		onenon 9873	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ∈ dom card)
25		fvelrn 7030	. . . . . . . . . . 11 ⊢ ((Fun card ∧ 𝑦 ∈ dom card) → (card‘𝑦) ∈ ran card)
26	23, 24, 25	sylancr 588	. . . . . . . . . 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 9881	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ⊆ 𝑦)
31	30	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (card‘𝑦) ⊆ 𝑦)
32		sseqin2 4177	. . . . . . . . . . 11 ⊢ ((card‘𝑦) ⊆ 𝑦 ↔ (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
33	31, 32	sylib 218	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
34	29, 33	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → 𝑥 = (card‘𝑦))
35		eleq1 2825	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝑥 ∈ ran card ↔ (card‘𝑦) ∈ ran card))
36		breq2 5104	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ (card‘𝑦)))
37	35, 36	anbi12d 633	. . . . . . . . 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 4191	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦
43	42	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦)
44	16, 41, 43	intabssd 43875	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)} ⊆ ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)})
45	13, 44	eqssd 3953	. . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
46		df-rab 3402	. . . 4 ⊢ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
47	46	inteqi 4908	. . 3 ⊢ ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
48		df-rab 3402	. . . 4 ⊢ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
49	48	inteqi 4908	. . 3 ⊢ ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
50	45, 47, 49	3eqtr4g 2797	. 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})
51	1, 50	eqtrd 2772	1 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {cab 2715  ∀wral 3052  {crab 3401  Vcvv 3442   ∩ cin 3902   ⊆ wss 3903  ∩ cint 4904   class class class wbr 5100  dom cdm 5632  ran crn 5633  Oncon0 6325  Fun wfun 6494  ‘cfv 6500   ≈ cen 8892   ≺ csdm 8894  harchar 9473  cardccrd 9859

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-oi 9427  df-har 9474  df-card 9863

This theorem is referenced by:  harval3on  43895