Metamath Proof Explorer


Theorem infinfnum

Description: Equivalence between two infiniteness criteria for numerable sets. (Contributed by BTernaryTau, 15-Jul-2026)

Ref Expression
Assertion infinfnum ⊢ A ∈ dom ⁡ card → ¬ A ∈ Fin ↔ ω ≼ A

Proof

Step Hyp Ref Expression
1 isfin4-2 ⊢ A ∈ dom ⁡ card → A ∈ FinIV ↔ ¬ ω ≼ A
2 1 con2bid ⊢ A ∈ dom ⁡ card → ω ≼ A ↔ ¬ A ∈ FinIV
3 fin45 ⊢ A ∈ FinIV → A ∈ FinV
4 fin56 ⊢ A ∈ FinV → A ∈ FinVI
5 fin67 ⊢ A ∈ FinVI → A ∈ FinVII
6 3 4 5 3syl ⊢ A ∈ FinIV → A ∈ FinVII
7 fin71num ⊢ A ∈ dom ⁡ card → A ∈ FinVII ↔ A ∈ Fin
8 6 7 imbitrid ⊢ A ∈ dom ⁡ card → A ∈ FinIV → A ∈ Fin
9 fin12 ⊢ A ∈ Fin → A ∈ FinII
10 fin23 ⊢ A ∈ FinII → A ∈ FinIII
11 fin34 ⊢ A ∈ FinIII → A ∈ FinIV
12 9 10 11 3syl ⊢ A ∈ Fin → A ∈ FinIV
13 8 12 impbid1 ⊢ A ∈ dom ⁡ card → A ∈ FinIV ↔ A ∈ Fin
14 13 notbid ⊢ A ∈ dom ⁡ card → ¬ A ∈ FinIV ↔ ¬ A ∈ Fin
15 2 14 bitr2d ⊢ A ∈ dom ⁡ card → ¬ A ∈ Fin ↔ ω ≼ A