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

Theorem ssfirab 7134
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 2793 . . 3 (𝑤 = ∅ → {𝑥𝑤𝜓} = {𝑥 ∈ ∅ ∣ 𝜓})
21eleq1d 2299 . 2 (𝑤 = ∅ → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin))
3 rabeq 2793 . . 3 (𝑤 = 𝑦 → {𝑥𝑤𝜓} = {𝑥𝑦𝜓})
43eleq1d 2299 . 2 (𝑤 = 𝑦 → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥𝑦𝜓} ∈ Fin))
5 rabeq 2793 . . 3 (𝑤 = (𝑦 ∪ {𝑧}) → {𝑥𝑤𝜓} = {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓})
65eleq1d 2299 . 2 (𝑤 = (𝑦 ∪ {𝑧}) → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin))
7 rabeq 2793 . . 3 (𝑤 = 𝐴 → {𝑥𝑤𝜓} = {𝑥𝐴𝜓})
87eleq1d 2299 . 2 (𝑤 = 𝐴 → ({𝑥𝑤𝜓} ∈ Fin ↔ {𝑥𝐴𝜓} ∈ Fin))
9 rab0 3522 . . . 4 {𝑥 ∈ ∅ ∣ 𝜓} = ∅
10 0fi 7078 . . . 4 ∅ ∈ Fin
119, 10eqeltri 2303 . . 3 {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin
1211a1i 9 . 2 (𝜑 → {𝑥 ∈ ∅ ∣ 𝜓} ∈ Fin)
13 rabun2 3485 . . . . 5 {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} = ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓})
14 sbsbc 3034 . . . . . . . . . 10 ([𝑧 / 𝑥]𝜓[𝑧 / 𝑥]𝜓)
15 vex 2804 . . . . . . . . . . 11 𝑧 ∈ V
16 ralsns 3708 . . . . . . . . . . 11 (𝑧 ∈ V → (∀𝑥 ∈ {𝑧}𝜓[𝑧 / 𝑥]𝜓))
1715, 16ax-mp 5 . . . . . . . . . 10 (∀𝑥 ∈ {𝑧}𝜓[𝑧 / 𝑥]𝜓)
1814, 17bitr4i 187 . . . . . . . . 9 ([𝑧 / 𝑥]𝜓 ↔ ∀𝑥 ∈ {𝑧}𝜓)
19 rabid2 2709 . . . . . . . . 9 ({𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓} ↔ ∀𝑥 ∈ {𝑧}𝜓)
2018, 19sylbb2 138 . . . . . . . 8 ([𝑧 / 𝑥]𝜓 → {𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓})
2120adantl 277 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑧} = {𝑥 ∈ {𝑧} ∣ 𝜓})
2221uneq2d 3360 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑧}) = ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}))
23 simplr 529 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑥𝑦𝜓} ∈ Fin)
2415a1i 9 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → 𝑧 ∈ V)
25 simprr 533 . . . . . . . . . 10 (((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) → 𝑧 ∈ (𝐴𝑦))
2625ad2antrr 488 . . . . . . . . 9 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → 𝑧 ∈ (𝐴𝑦))
2726eldifbd 3211 . . . . . . . 8 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ¬ 𝑧𝑦)
28 elrabi 2958 . . . . . . . 8 (𝑧 ∈ {𝑥𝑦𝜓} → 𝑧𝑦)
2927, 28nsyl 633 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ¬ 𝑧 ∈ {𝑥𝑦𝜓})
30 unsnfi 7116 . . . . . . 7 (({𝑥𝑦𝜓} ∈ Fin ∧ 𝑧 ∈ V ∧ ¬ 𝑧 ∈ {𝑥𝑦𝜓}) → ({𝑥𝑦𝜓} ∪ {𝑧}) ∈ Fin)
3123, 24, 29, 30syl3anc 1273 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑧}) ∈ Fin)
3222, 31eqeltrrd 2308 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) ∈ Fin)
3313, 32eqeltrid 2317 . . . 4 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
34 ralsns 3708 . . . . . . . . . . . 12 (𝑧 ∈ V → (∀𝑥 ∈ {𝑧} ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓))
3515, 34ax-mp 5 . . . . . . . . . . 11 (∀𝑥 ∈ {𝑧} ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓)
36 sbsbc 3034 . . . . . . . . . . 11 ([𝑧 / 𝑥] ¬ 𝜓[𝑧 / 𝑥] ¬ 𝜓)
37 sbn 2004 . . . . . . . . . . 11 ([𝑧 / 𝑥] ¬ 𝜓 ↔ ¬ [𝑧 / 𝑥]𝜓)
3835, 36, 373bitr2ri 209 . . . . . . . . . 10 (¬ [𝑧 / 𝑥]𝜓 ↔ ∀𝑥 ∈ {𝑧} ¬ 𝜓)
39 rabeq0 3523 . . . . . . . . . 10 ({𝑥 ∈ {𝑧} ∣ 𝜓} = ∅ ↔ ∀𝑥 ∈ {𝑧} ¬ 𝜓)
4038, 39sylbb2 138 . . . . . . . . 9 (¬ [𝑧 / 𝑥]𝜓 → {𝑥 ∈ {𝑧} ∣ 𝜓} = ∅)
4140adantl 277 . . . . . . . 8 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ {𝑧} ∣ 𝜓} = ∅)
4241uneq2d 3360 . . . . . . 7 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) = ({𝑥𝑦𝜓} ∪ ∅))
43 un0 3527 . . . . . . 7 ({𝑥𝑦𝜓} ∪ ∅) = {𝑥𝑦𝜓}
4442, 43eqtrdi 2279 . . . . . 6 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → ({𝑥𝑦𝜓} ∪ {𝑥 ∈ {𝑧} ∣ 𝜓}) = {𝑥𝑦𝜓})
4513, 44eqtrid 2275 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} = {𝑥𝑦𝜓})
46 simplr 529 . . . . 5 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥𝑦𝜓} ∈ Fin)
4745, 46eqeltrd 2307 . . . 4 (((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) ∧ ¬ [𝑧 / 𝑥]𝜓) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
48 simplrr 538 . . . . . . 7 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → 𝑧 ∈ (𝐴𝑦))
4948eldifad 3210 . . . . . 6 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → 𝑧𝐴)
50 ssfirab.dc . . . . . . 7 (𝜑 → ∀𝑥𝐴 DECID 𝜓)
5150ad3antrrr 492 . . . . . 6 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → ∀𝑥𝐴 DECID 𝜓)
52 nfs1v 1991 . . . . . . . 8 𝑥[𝑧 / 𝑥]𝜓
5352nfdc 1706 . . . . . . 7 𝑥DECID [𝑧 / 𝑥]𝜓
54 sbequ12 1818 . . . . . . . 8 (𝑥 = 𝑧 → (𝜓 ↔ [𝑧 / 𝑥]𝜓))
5554dcbid 845 . . . . . . 7 (𝑥 = 𝑧 → (DECID 𝜓DECID [𝑧 / 𝑥]𝜓))
5653, 55rspc 2903 . . . . . 6 (𝑧𝐴 → (∀𝑥𝐴 DECID 𝜓DECID [𝑧 / 𝑥]𝜓))
5749, 51, 56sylc 62 . . . . 5 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → DECID [𝑧 / 𝑥]𝜓)
58 exmiddc 843 . . . . 5 (DECID [𝑧 / 𝑥]𝜓 → ([𝑧 / 𝑥]𝜓 ∨ ¬ [𝑧 / 𝑥]𝜓))
5957, 58syl 14 . . . 4 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → ([𝑧 / 𝑥]𝜓 ∨ ¬ [𝑧 / 𝑥]𝜓))
6033, 47, 59mpjaodan 805 . . 3 ((((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) ∧ {𝑥𝑦𝜓} ∈ Fin) → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin)
6160ex 115 . 2 (((𝜑𝑦 ∈ Fin) ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) → ({𝑥𝑦𝜓} ∈ Fin → {𝑥 ∈ (𝑦 ∪ {𝑧}) ∣ 𝜓} ∈ Fin))
62 ssfirab.a . 2 (𝜑𝐴 ∈ Fin)
632, 4, 6, 8, 12, 61, 62findcard2sd 7086 1 (𝜑 → {𝑥𝐴𝜓} ∈ Fin)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 715  DECID wdc 841   = wceq 1397  [wsb 1809  wcel 2201  wral 2509  {crab 2513  Vcvv 2801  [wsbc 3030  cdif 3196  cun 3197  wss 3199  c0 3493  {csn 3670  Fincfn 6914
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-tr 4189  df-id 4392  df-iord 4465  df-on 4467  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-1o 6587  df-er 6707  df-en 6915  df-fin 6917
This theorem is referenced by:  ssfidc  7135  phivalfi  12807  hashdvds  12816  phiprmpw  12817  phimullem  12820  hashgcdeq  12835  lgsquadlemofi  15834  lgsquadlem1  15835  lgsquadlem2  15836  vtxedgfi  16169  vtxlpfi  16170  konigsberglem5  16372
  Copyright terms: Public domain W3C validator