Theorem cardonle 7254

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

Syntax hints:   → wi 4   ∈ wcel 2167  {crab 2479   ⊆ wss 3157  ∩ cint 3874   class class class wbr 4033  Oncon0 4398  ‘cfv 5258   ≈ cen 6797  cardccrd 7246

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-en 6800  df-card 7247

This theorem is referenced by:  card0  7255