Theorem difinfinf 7441

Description: An infinite set minus a finite subset is infinite. We require that the set has decidable equality. (Contributed by Jim Kingdon, 8-Aug-2023.)

Assertion

Ref	Expression
difinfinf	⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → ω ≼ (𝐴 ∖ 𝐵))

Distinct variable group:   𝑥,𝐴,𝑦

Allowed substitution hints:   𝐵(𝑥, 𝑦)

Proof of Theorem difinfinf

Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difeq2 3341	. . 3 ⊢ (𝑤 = ∅ → (𝐴 ∖ 𝑤) = (𝐴 ∖ ∅))
2	1	breq2d 4142	. 2 ⊢ (𝑤 = ∅ → (ω ≼ (𝐴 ∖ 𝑤) ↔ ω ≼ (𝐴 ∖ ∅)))
3		difeq2 3341	. . 3 ⊢ (𝑤 = 𝑢 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝑢))
4	3	breq2d 4142	. 2 ⊢ (𝑤 = 𝑢 → (ω ≼ (𝐴 ∖ 𝑤) ↔ ω ≼ (𝐴 ∖ 𝑢)))
5		difeq2 3341	. . 3 ⊢ (𝑤 = (𝑢 ∪ {𝑣}) → (𝐴 ∖ 𝑤) = (𝐴 ∖ (𝑢 ∪ {𝑣})))
6	5	breq2d 4142	. 2 ⊢ (𝑤 = (𝑢 ∪ {𝑣}) → (ω ≼ (𝐴 ∖ 𝑤) ↔ ω ≼ (𝐴 ∖ (𝑢 ∪ {𝑣}))))
7		difeq2 3341	. . 3 ⊢ (𝑤 = 𝐵 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝐵))
8	7	breq2d 4142	. 2 ⊢ (𝑤 = 𝐵 → (ω ≼ (𝐴 ∖ 𝑤) ↔ ω ≼ (𝐴 ∖ 𝐵)))
9		simplr 533	. . 3 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → ω ≼ 𝐴)
10		dif0 3596	. . 3 ⊢ (𝐴 ∖ ∅) = 𝐴
11	9, 10	breqtrrdi 4172	. 2 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → ω ≼ (𝐴 ∖ ∅))
12		difss 3355	. . . . . . 7 ⊢ (𝐴 ∖ 𝑢) ⊆ 𝐴
13		ssralv 3312	. . . . . . . . 9 ⊢ ((𝐴 ∖ 𝑢) ⊆ 𝐴 → (∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦))
14	12, 13	ax-mp 5	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦)
15	14	ralimi 2613	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦)
16		ssralv 3312	. . . . . . 7 ⊢ ((𝐴 ∖ 𝑢) ⊆ 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦 → ∀𝑥 ∈ (𝐴 ∖ 𝑢)∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦))
17	12, 15, 16	mpsyl 65	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → ∀𝑥 ∈ (𝐴 ∖ 𝑢)∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦)
18	17	ad5antr 500	. . . . 5 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → ∀𝑥 ∈ (𝐴 ∖ 𝑢)∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦)
19		simpr 110	. . . . 5 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → ω ≼ (𝐴 ∖ 𝑢))
20		simprl 535	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → 𝐵 ⊆ 𝐴)
21	20	ad3antrrr 496	. . . . . 6 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → 𝐵 ⊆ 𝐴)
22		simplrr 542	. . . . . 6 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → 𝑣 ∈ (𝐵 ∖ 𝑢))
23		ssdif 3364	. . . . . . 7 ⊢ (𝐵 ⊆ 𝐴 → (𝐵 ∖ 𝑢) ⊆ (𝐴 ∖ 𝑢))
24	23	sseld 3247	. . . . . 6 ⊢ (𝐵 ⊆ 𝐴 → (𝑣 ∈ (𝐵 ∖ 𝑢) → 𝑣 ∈ (𝐴 ∖ 𝑢)))
25	21, 22, 24	sylc 62	. . . . 5 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → 𝑣 ∈ (𝐴 ∖ 𝑢))
26		difinfsn 7440	. . . . 5 ⊢ ((∀𝑥 ∈ (𝐴 ∖ 𝑢)∀𝑦 ∈ (𝐴 ∖ 𝑢)DECID 𝑥 = 𝑦 ∧ ω ≼ (𝐴 ∖ 𝑢) ∧ 𝑣 ∈ (𝐴 ∖ 𝑢)) → ω ≼ ((𝐴 ∖ 𝑢) ∖ {𝑣}))
27	18, 19, 25, 26	syl3anc 1278	. . . 4 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → ω ≼ ((𝐴 ∖ 𝑢) ∖ {𝑣}))
28		difun1 3491	. . . 4 ⊢ (𝐴 ∖ (𝑢 ∪ {𝑣})) = ((𝐴 ∖ 𝑢) ∖ {𝑣})
29	27, 28	breqtrrdi 4172	. . 3 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) ∧ ω ≼ (𝐴 ∖ 𝑢)) → ω ≼ (𝐴 ∖ (𝑢 ∪ {𝑣})))
30	29	ex 115	. 2 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) ∧ 𝑢 ∈ Fin) ∧ (𝑢 ⊆ 𝐵 ∧ 𝑣 ∈ (𝐵 ∖ 𝑢))) → (ω ≼ (𝐴 ∖ 𝑢) → ω ≼ (𝐴 ∖ (𝑢 ∪ {𝑣}))))
31		simprr 537	. 2 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → 𝐵 ∈ Fin)
32	2, 4, 6, 8, 11, 30, 31	findcard2sd 7196	1 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ∈ Fin)) → ω ≼ (𝐴 ∖ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104  DECID wdc 846   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ∖ cdif 3217   ∪ cun 3218   ⊆ wss 3220  ∅c0 3520  {csn 3709   class class class wbr 4130  ωcom 4737   ≼ cdom 7021  Fincfn 7022

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-dju 7378  df-inl 7387  df-inr 7388  df-case 7424

This theorem is used by:  inffinp1  13322