Theorem cardonle 7451

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 7450	. 2 ⊢ (𝐴 ∈ On → (card‘𝐴) = ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴})
2		enrefg 6980	. . 3 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴)
3		breq1 4096	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ≈ 𝐴 ↔ 𝐴 ≈ 𝐴))
4	3	intminss 3958	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐴 ≈ 𝐴) → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ⊆ 𝐴)
5	2, 4	mpdan 421	. 2 ⊢ (𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ 𝑥 ≈ 𝐴} ⊆ 𝐴)
6	1, 5	eqsstrd 3264	1 ⊢ (𝐴 ∈ On → (card‘𝐴) ⊆ 𝐴)

Syntax hints:   → wi 4   ∈ wcel 2202  {crab 2515   ⊆ wss 3201  ∩ cint 3933   class class class wbr 4093  Oncon0 4466  ‘cfv 5333   ≈ cen 6950  cardccrd 7441

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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-en 6953  df-card 7443

This theorem is referenced by:  card0  7452