Theorem harval3 44264

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 9979	. 2 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦})
2		vex 3459	. . . . . 6 ⊢ 𝑥 ∈ V
3	2	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ∈ V)
4		elrncard 44263	. . . . . . . . 9 ⊢ (𝑥 ∈ ran card ↔ (𝑥 ∈ On ∧ ∀𝑦 ∈ 𝑥 ¬ 𝑦 ≈ 𝑥))
5	4	simplbi 501	. . . . . . . 8 ⊢ (𝑥 ∈ ran card → 𝑥 ∈ On)
6	5	anim1i 626	. . . . . . 7 ⊢ ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥))
7		eleq1 2851	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ On ↔ 𝑥 ∈ On))
8		breq2 5113	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝐴 ≺ 𝑦 ↔ 𝐴 ≺ 𝑥))
9	7, 8	anbi12d 643	. . . . . . 7 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) ↔ (𝑥 ∈ On ∧ 𝐴 ≺ 𝑥)))
10	6, 9	imbitrrid 249	. . . . . 6 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
11	10	adantl 486	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑦 = 𝑥) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) → (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)))
12		ssidd 3960	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝑥 ⊆ 𝑥)
13	3, 11, 12	intabssd 44245	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} ⊆ ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
14		vex 3459	. . . . . . 7 ⊢ 𝑦 ∈ V
15	14	inex1 5286	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ∈ V
16	15	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ∈ V)
17		oncardid 9938	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ≈ 𝑦)
18	17	ensymd 8998	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ≈ (card‘𝑦))
19		sdomentr 9095	. . . . . . . . . . . 12 ⊢ ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦))
20	19	a1i 11	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → ((𝐴 ≺ 𝑦 ∧ 𝑦 ≈ (card‘𝑦)) → 𝐴 ≺ (card‘𝑦)))
21	18, 20	mpan2d 706	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (𝐴 ≺ 𝑦 → 𝐴 ≺ (card‘𝑦)))
22		df-card 9921	. . . . . . . . . . . 12 ⊢ card = (𝑥 ∈ V ↦ ∩ {𝑦 ∈ On ∣ 𝑦 ≈ 𝑥})
23	22	funmpt2 6575	. . . . . . . . . . 11 ⊢ Fun card
24		onenon 9931	. . . . . . . . . . 11 ⊢ (𝑦 ∈ On → 𝑦 ∈ dom card)
25		fvelrn 7071	. . . . . . . . . . 11 ⊢ ((Fun card ∧ 𝑦 ∈ dom card) → (card‘𝑦) ∈ ran card)
26	23, 24, 25	sylancr 598	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (card‘𝑦) ∈ ran card)
27	21, 26	jctild 534	. . . . . . . . 9 ⊢ (𝑦 ∈ On → (𝐴 ≺ 𝑦 → ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
28	27	adantl 486	. . . . . . . 8 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝐴 ≺ 𝑦 → ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
29		simpl 487	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → 𝑥 = (𝑦 ∩ (card‘𝑦)))
30		cardonle 9939	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ On → (card‘𝑦) ⊆ 𝑦)
31	30	adantl 486	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (card‘𝑦) ⊆ 𝑦)
32		sseqin2 4176	. . . . . . . . . . 11 ⊢ ((card‘𝑦) ⊆ 𝑦 ↔ (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
33	31, 32	sylib 221	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝑦 ∩ (card‘𝑦)) = (card‘𝑦))
34	29, 33	eqtrd 2798	. . . . . . . . 9 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → 𝑥 = (card‘𝑦))
35		eleq1 2851	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝑥 ∈ ran card ↔ (card‘𝑦) ∈ ran card))
36		breq2 5113	. . . . . . . . . 10 ⊢ (𝑥 = (card‘𝑦) → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ (card‘𝑦)))
37	35, 36	anbi12d 643	. . . . . . . . 9 ⊢ (𝑥 = (card‘𝑦) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) ↔ ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
38	34, 37	syl 18	. . . . . . . 8 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → ((𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥) ↔ ((card‘𝑦) ∈ ran card ∧ 𝐴 ≺ (card‘𝑦))))
39	28, 38	sylibrd 262	. . . . . . 7 ⊢ ((𝑥 = (𝑦 ∩ (card‘𝑦)) ∧ 𝑦 ∈ On) → (𝐴 ≺ 𝑦 → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
40	39	expimpd 458	. . . . . 6 ⊢ (𝑥 = (𝑦 ∩ (card‘𝑦)) → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
41	40	adantl 486	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝑥 = (𝑦 ∩ (card‘𝑦))) → ((𝑦 ∈ On ∧ 𝐴 ≺ 𝑦) → (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)))
42		inss1 4189	. . . . . 6 ⊢ (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦
43	42	a1i 11	. . . . 5 ⊢ (𝐴 ∈ dom card → (𝑦 ∩ (card‘𝑦)) ⊆ 𝑦)
44	16, 41, 43	intabssd 44245	. . . 4 ⊢ (𝐴 ∈ dom card → ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)} ⊆ ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)})
45	13, 44	eqssd 3954	. . 3 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)})
46		df-rab 3417	. . . 4 ⊢ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
47	46	inteqi 4916	. . 3 ⊢ ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑦 ∣ (𝑦 ∈ On ∧ 𝐴 ≺ 𝑦)}
48		df-rab 3417	. . . 4 ⊢ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
49	48	inteqi 4916	. . 3 ⊢ ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥} = ∩ {𝑥 ∣ (𝑥 ∈ ran card ∧ 𝐴 ≺ 𝑥)}
50	45, 47, 49	3eqtr4g 2823	. 2 ⊢ (𝐴 ∈ dom card → ∩ {𝑦 ∈ On ∣ 𝐴 ≺ 𝑦} = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})
51	1, 50	eqtrd 2798	1 ⊢ (𝐴 ∈ dom card → (har‘𝐴) = ∩ {𝑥 ∈ ran card ∣ 𝐴 ≺ 𝑥})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {cab 2741  ∀wral 3079  {crab 3416  Vcvv 3455   ∩ cin 3904   ⊆ wss 3905  ∩ cint 4912   class class class wbr 5109  dom cdm 5661  ran crn 5662  Oncon0 6360  Fun wfun 6530  ‘cfv 6536   ≈ cen 8936   ≺ csdm 8938  harchar 9514  cardccrd 9917

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  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 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-oi 9468  df-har 9515  df-card 9921

This theorem is referenced by:  harval3on  44265