ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssfirab GIF version

Theorem ssfirab 6750
Description: A subset of a finite set is finite if it is defined by a decidable property. (Contributed by Jim Kingdon, 27-May-2022.)
Hypotheses
Ref Expression
ssfirab.a (𝜑𝐴 ∈ Fin)
ssfirab.dc (𝜑 → ∀𝑥𝐴 DECID 𝜓)
Assertion
Ref Expression
ssfirab (𝜑 → {𝑥𝐴𝜓} ∈ Fin)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem ssfirab
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rabeq 2633 . . 3 (𝑤 = ∅ → {𝑥𝑤𝜓} = {𝑥 ∈ ∅ ∣ 𝜓})
21eleq1d 2168 . 2 (𝑤 = ∅ → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin))
3 rabeq 2633 . . 3 (𝑤 = 𝑦 → {𝑥𝑤𝜓} = {𝑥𝑦𝜓})
43eleq1d 2168 . 2 (𝑤 = 𝑦 → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥𝑦𝜓} ∈ Fin))
5 rabeq 2633 . . 3 (𝑤 = (𝑦 ∪ {𝑧}) → {𝑥𝑤𝜓} = {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓})
65eleq1d 2168 . 2 (𝑤 = (𝑦 ∪ {𝑧}) → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin))
7 rabeq 2633 . . 3 (𝑤 = 𝐴 → {𝑥𝑤𝜓} = {𝑥𝐴𝜓})
87eleq1d 2168 . 2 (𝑤 = 𝐴 → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥𝐴𝜓} ∈ Fin))
9 rab0 3338 . . . 4 {𝑥 ∈ ∅ ∣ 𝜓} = ∅
10 0fin 6707 . . . 4 ∅ ∈ Fin
119, 10eqeltri 2172 . . 3 {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin
1211a1i 9 . 2 (𝜑 → {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin)
13 rabun2 3302 . . . . 5 {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} = ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓})
14 sbsbc 2866 . . . . . . . . . 10 ([𝑧 / 𝑥]𝜓[𝑧 / 𝑥]𝜓)
15 vex 2644 . . . . . . . . . . 11 𝑧 ∈ V
16 ralsns 3509 . . . . . . . . . . 11 (𝑧 ∈ V → (∀𝑥 ∈ {𝑧}𝜓[𝑧 / 𝑥]𝜓))
1715, 16ax-mp 7 . . . . . . . . . 10 (∀𝑥 ∈ {𝑧}𝜓[𝑧 / 𝑥]𝜓)
1814, 17bitr4i 186 . . . . . . . . 9 ([𝑧 / 𝑥]𝜓 ↔ ∀𝑥 ∈ {𝑧}𝜓)
19 rabid2 2565 . . . . . . . . 9 ({𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓} ↔ ∀𝑥 ∈ {𝑧}𝜓)
2018, 19sylbb2 137 . . . . . . . 8 ([𝑧 / 𝑥]𝜓 → {𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓})
2120adantl 273 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓})
2221uneq2d 3177 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑧}) = ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}))
23 simplr 500 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑥𝑦𝜓} ∈ Fin)
2415a1i 9 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → 𝑧 ∈ V)
25 simprr 502 . . . . . . . . . 10 (((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) → 𝑧 ∈ (𝐴𝑦))
2625ad2antrr 475 . . . . . . . . 9 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → 𝑧 ∈ (𝐴𝑦))
2726eldifbd 3033 . . . . . . . 8 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ¬ 𝑧𝑦)
28 elrabi 2790 . . . . . . . 8 (𝑧 ∈ {𝑥𝑦𝜓} → 𝑧𝑦)
2927, 28nsyl 598 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ¬ 𝑧 ∈ {𝑥𝑦𝜓})
30 unsnfi 6736 . . . . . . 7 (({𝑥𝑦𝜓} ∈ Fin ∧ 𝑧 ∈ V ∧ ¬ 𝑧 ∈ {𝑥𝑦𝜓}) → ({𝑥𝑦𝜓} ∪ {𝑧}) ∈ Fin)
3123, 24, 29, 30syl3anc 1184 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑧}) ∈ Fin)
3222, 31eqeltrrd 2177 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) ∈ Fin)
3313, 32syl5eqel 2186 . . . 4 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
34 ralsns 3509 . . . . . . . . . . . 12 (𝑧 ∈ V → (∀𝑥 ∈ {𝑧} ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓))
3515, 34ax-mp 7 . . . . . . . . . . 11 (∀𝑥 ∈ {𝑧} ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓)
36 sbsbc 2866 . . . . . . . . . . 11 ([𝑧 / 𝑥] ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓)
37 sbn 1886 . . . . . . . . . . 11 ([𝑧 / 𝑥] ¬ 𝜓 ↔ ¬ [𝑧 / 𝑥]𝜓)
3835, 36, 373bitr2ri 208 . . . . . . . . . 10 (¬ [𝑧 / 𝑥]𝜓 ↔ ∀𝑥 ∈ {𝑧} ¬ 𝜓)
39 rabeq0 3339 . . . . . . . . . 10 ({𝑥 ∈ {𝑧} ∣ 𝜓} = ∅ ↔ ∀𝑥 ∈ {𝑧} ¬ 𝜓)
4038, 39sylbb2 137 . . . . . . . . 9 (¬ [𝑧 / 𝑥]𝜓 → {𝑥 ∈ {𝑧} ∣ 𝜓} = ∅)
4140adantl 273 . . . . . . . 8 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ {𝑧} ∣ 𝜓} = ∅)
4241uneq2d 3177 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) = ({𝑥𝑦𝜓} ∪ ∅))
43 un0 3343 . . . . . . 7 ({𝑥𝑦𝜓} ∪ ∅) = {𝑥𝑦𝜓}
4442, 43syl6eq 2148 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) = {𝑥𝑦𝜓})
4513, 44syl5eq 2144 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} = {𝑥𝑦𝜓})
46 simplr 500 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥𝑦𝜓} ∈ Fin)
4745, 46eqeltrd 2176 . . . 4 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
48 simplrr 506 . . . . . . 7 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → 𝑧 ∈ (𝐴𝑦))
4948eldifad 3032 . . . . . 6 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → 𝑧𝐴)
50 ssfirab.dc . . . . . . 7 (𝜑 → ∀𝑥𝐴 DECID 𝜓)
5150ad3antrrr 479 . . . . . 6 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → ∀𝑥𝐴 DECID 𝜓)
52 nfs1v 1875 . . . . . . . 8 𝑥[𝑧 / 𝑥]𝜓
5352nfdc 1605 . . . . . . 7 𝑥DECID [𝑧 / 𝑥]𝜓
54 sbequ12 1712 . . . . . . . 8 (𝑥 = 𝑧 → (𝜓 ↔ [𝑧 / 𝑥]𝜓))
5554dcbid 792 . . . . . . 7 (𝑥 = 𝑧 → (DECID 𝜓DECID [𝑧 / 𝑥]𝜓))
5653, 55rspc 2738 . . . . . 6 (𝑧𝐴 → (∀𝑥𝐴 DECID 𝜓DECID [𝑧 / 𝑥]𝜓))
5749, 51, 56sylc 62 . . . . 5 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → DECID [𝑧 / 𝑥]𝜓)
58 exmiddc 788 . . . . 5 (DECID [𝑧 / 𝑥]𝜓 → ([𝑧 / 𝑥]𝜓 ∨ ¬ [𝑧 / 𝑥]𝜓))
5957, 58syl 14 . . . 4 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → ([𝑧 / 𝑥]𝜓 ∨ ¬ [𝑧 / 𝑥]𝜓))
6033, 47, 59mpjaodan 753 . . 3 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
6160ex 114 . 2 (((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) → ({𝑥𝑦𝜓} ∈ Fin → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin))
62 ssfirab.a . 2 (𝜑𝐴 ∈ Fin)
632, 4, 6, 8, 12, 61, 62findcard2sd 6715 1 (𝜑 → {𝑥𝐴𝜓} ∈ Fin)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 670  DECID wdc 786   = wceq 1299  wcel 1448  [wsb 1703  wral 2375  {crab 2379  Vcvv 2641  [wsbc 2862  cdif 3018  cun 3019  wss 3021  c0 3310  {csn 3474  Fincfn 6564
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-coll 3983  ax-sep 3986  ax-nul 3994  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390  ax-iinf 4440
This theorem depends on definitions:  df-bi 116  df-dc 787  df-3or 931  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-ral 2380  df-rex 2381  df-reu 2382  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-nul 3311  df-if 3422  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-tr 3967  df-id 4153  df-iord 4226  df-on 4228  df-suc 4231  df-iom 4443  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-1o 6243  df-er 6359  df-en 6565  df-fin 6567
This theorem is referenced by:  ssfidc  6751  phivalfi  11680  hashdvds  11689  phiprmpw  11690  phimullem  11693  hashgcdeq  11696
  Copyright terms: Public domain W3C validator