Theorem cardonle 7496

Description: The cardinal of an ordinal number is less than or equal to the ordinal number. Proposition 10.6(3) of [TakeutiZaring] p. 85. (Contributed by NM, 22-Oct-2003.)

Assertion

Ref	Expression
cardonle	⊢ (𝐴 ∈ On → (card‘𝐴) ⊆ 𝐴)

Proof of Theorem cardonle

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oncardval 7495	. 2 ⊢ (𝐴 ∈ On → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
2		enrefg 7016	. . 3 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴)
3		breq1 4117	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝐴 ↔ 𝐴 ≈ 𝐴))
4	3	intminss 3979	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐴) → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ⊆ 𝐴)
5	2, 4	mpdan 421	. 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ⊆ 𝐴)
6	1, 5	eqsstrd 3278	1 ⊢ (𝐴 ∈ On → (card‘𝐴) ⊆ 𝐴)

Syntax hints:   → wi 4   ∈ wcel 2205  {crab 2526   ⊆ wss 3214  ∩ cint 3954   class class class wbr 4114  Oncon0 4489  ‘cfv 5357   ≈ cen 6986  cardccrd 7486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-en 6989  df-card 7488

This theorem is referenced by:  card0  7497