Theorem fin1ai 9715

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 2900	. . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ Fin ↔ 𝑋 ∈ Fin))
2		difeq2 4093	. . . 4 ⊢ (𝑥 = 𝑋 → (𝐴 ∖ 𝑥) = (𝐴 ∖ 𝑋))
3	2	eleq1d 2897	. . 3 ⊢ (𝑥 = 𝑋 → ((𝐴 ∖ 𝑥) ∈ Fin ↔ (𝐴 ∖ 𝑋) ∈ Fin))
4	1, 3	orbi12d 915	. 2 ⊢ (𝑥 = 𝑋 → ((𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin) ↔ (𝑋 ∈ Fin ∨ (𝐴 ∖ 𝑋) ∈ Fin)))
5		isfin1a 9714	. . . 4 ⊢ (𝐴 ∈ FinIa → (𝐴 ∈ FinIa ↔ ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin)))
6	5	ibi 269	. . 3 ⊢ (𝐴 ∈ FinIa → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin))
7	6	adantr 483	. 2 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → ∀𝑥 ∈ 𝒫 𝐴(𝑥 ∈ Fin ∨ (𝐴 ∖ 𝑥) ∈ Fin))
8		elpw2g 5247	. . 3 ⊢ (𝐴 ∈ FinIa → (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴))
9	8	biimpar 480	. 2 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → 𝑋 ∈ 𝒫 𝐴)
10	4, 7, 9	rspcdva 3625	1 ⊢ ((𝐴 ∈ FinIa ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∈ Fin ∨ (𝐴 ∖ 𝑋) ∈ Fin))

Syntax hints:   → wi 4   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114  ∀wral 3138   ∖ cdif 3933   ⊆ wss 3936  𝒫 cpw 4539  Fincfn 8509  Fin^Iacfin1a 9700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-pw 4541  df-fin1a 9707

This theorem is referenced by:  enfin1ai  9806  fin1a2  9837  fin1aufil  22540