Theorem fin1ai 10276

Description: Property of a Ia-finite set. (Contributed by Stefan O'Rear, 16-May-2015.)

Assertion

Ref	Expression
fin1ai	⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∈ Fin ∨ (𝐴 ∖ 𝑋) ∈ Fin))

Proof of Theorem fin1ai

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2849	. . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ Fin ↔ 𝑋 ∈ Fin))
2		difeq2 4074	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐴 ∖ 𝑥) = (𝐴 ∖ 𝑋))
3	2	eleq1d 2846	. . 3 ⊢ (𝑥 = 𝑋 → ((𝐴 ∖ 𝑥) ∈ Fin ↔ (𝐴 ∖ 𝑋) ∈ Fin))
4	1, 3	orbi12d 931	. 2 ⊢ (𝑥 = 𝑋 → ((𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin) ↔ (𝑋 ∈ Fin ∨ (𝐴 ∖ 𝑋) ∈ Fin)))
5		isfin1a 10275	. . . 4 ⊢ (𝐴 ∈ FinIa → (𝐴 ∈ FinIa ↔ ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin)))
6	5	ibi 270	. . 3 ⊢ (𝐴 ∈ FinIa → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin))
7	6	adantr 485	. 2 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin))
8		elpw2g 5303	. . 3 ⊢ (𝐴 ∈ FinIa → (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴))
9	8	biimpar 482	. 2 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → 𝑋 ∈ 𝒫 𝐴)
10	4, 7, 9	rspcdva 3581	1 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∈ Fin ∨ (𝐴 ∖ 𝑋) ∈ Fin))

Syntax hints:   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1568   ∈ wcel 2141  ∀wral 3077   ∖ cdif 3901   ⊆ wss 3904  𝒫 cpw 4561  Fincfn 8942  Fin^Iacfin1a 10261

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5256

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3415  df-v 3455  df-dif 3907  df-in 3911  df-ss 3921  df-pw 4563  df-fin1a 10268

This theorem is referenced by:  enfin1ai  10367  fin1a2  10398  fin1aufil  24068