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

Theorem frecabex 6453
Description: The class abstraction from df-frec 6446 exists. This is a lemma for other finite recursion proofs. (Contributed by Jim Kingdon, 13-May-2020.)
Hypotheses
Ref Expression
frecabex.sex (𝜑𝑆𝑉)
frecabex.fvex (𝜑 → ∀𝑦(𝐹𝑦) ∈ V)
frecabex.aex (𝜑𝐴𝑊)
Assertion
Ref Expression
frecabex (𝜑 → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) ∨ (dom 𝑆 = ∅ ∧ 𝑥𝐴))} ∈ V)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑆,𝑦   𝜑,𝑚   𝑥,𝑚,𝑦   𝑦,𝐹
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑦,𝑚)   𝑆(𝑚)   𝐹(𝑚)   𝑉(𝑥,𝑦,𝑚)   𝑊(𝑥,𝑦,𝑚)

Proof of Theorem frecabex
StepHypRef Expression
1 omex 4626 . . . 4 ω ∈ V
2 simpr 110 . . . . . . 7 ((dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) → 𝑥 ∈ (𝐹‘(𝑆𝑚)))
32abssi 3255 . . . . . 6 {𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ⊆ (𝐹‘(𝑆𝑚))
4 frecabex.sex . . . . . . . 8 (𝜑𝑆𝑉)
5 vex 2763 . . . . . . . 8 𝑚 ∈ V
6 fvexg 5574 . . . . . . . 8 ((𝑆𝑉𝑚 ∈ V) → (𝑆𝑚) ∈ V)
74, 5, 6sylancl 413 . . . . . . 7 (𝜑 → (𝑆𝑚) ∈ V)
8 frecabex.fvex . . . . . . 7 (𝜑 → ∀𝑦(𝐹𝑦) ∈ V)
9 fveq2 5555 . . . . . . . . 9 (𝑦 = (𝑆𝑚) → (𝐹𝑦) = (𝐹‘(𝑆𝑚)))
109eleq1d 2262 . . . . . . . 8 (𝑦 = (𝑆𝑚) → ((𝐹𝑦) ∈ V ↔ (𝐹‘(𝑆𝑚)) ∈ V))
1110spcgv 2848 . . . . . . 7 ((𝑆𝑚) ∈ V → (∀𝑦(𝐹𝑦) ∈ V → (𝐹‘(𝑆𝑚)) ∈ V))
127, 8, 11sylc 62 . . . . . 6 (𝜑 → (𝐹‘(𝑆𝑚)) ∈ V)
13 ssexg 4169 . . . . . 6 (({𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ⊆ (𝐹‘(𝑆𝑚)) ∧ (𝐹‘(𝑆𝑚)) ∈ V) → {𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V)
143, 12, 13sylancr 414 . . . . 5 (𝜑 → {𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V)
1514ralrimivw 2568 . . . 4 (𝜑 → ∀𝑚 ∈ ω {𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V)
16 abrexex2g 6174 . . . 4 ((ω ∈ V ∧ ∀𝑚 ∈ ω {𝑥 ∣ (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V) → {𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V)
171, 15, 16sylancr 414 . . 3 (𝜑 → {𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V)
18 simpr 110 . . . . 5 ((dom 𝑆 = ∅ ∧ 𝑥𝐴) → 𝑥𝐴)
1918abssi 3255 . . . 4 {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ⊆ 𝐴
20 frecabex.aex . . . 4 (𝜑𝐴𝑊)
21 ssexg 4169 . . . 4 (({𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ⊆ 𝐴𝐴𝑊) → {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ∈ V)
2219, 20, 21sylancr 414 . . 3 (𝜑 → {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ∈ V)
2317, 22jca 306 . 2 (𝜑 → ({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V ∧ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ∈ V))
24 unexb 4474 . . 3 (({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V ∧ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ∈ V) ↔ ({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∪ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)}) ∈ V)
25 unab 3427 . . . 4 ({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∪ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)}) = {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) ∨ (dom 𝑆 = ∅ ∧ 𝑥𝐴))}
2625eleq1i 2259 . . 3 (({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∪ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)}) ∈ V ↔ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) ∨ (dom 𝑆 = ∅ ∧ 𝑥𝐴))} ∈ V)
2724, 26bitri 184 . 2 (({𝑥 ∣ ∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚)))} ∈ V ∧ {𝑥 ∣ (dom 𝑆 = ∅ ∧ 𝑥𝐴)} ∈ V) ↔ {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) ∨ (dom 𝑆 = ∅ ∧ 𝑥𝐴))} ∈ V)
2823, 27sylib 122 1 (𝜑 → {𝑥 ∣ (∃𝑚 ∈ ω (dom 𝑆 = suc 𝑚𝑥 ∈ (𝐹‘(𝑆𝑚))) ∨ (dom 𝑆 = ∅ ∧ 𝑥𝐴))} ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 709  wal 1362   = wceq 1364  wcel 2164  {cab 2179  wral 2472  wrex 2473  Vcvv 2760  cun 3152  wss 3154  c0 3447  suc csuc 4397  ωcom 4623  dom cdm 4660  cfv 5255
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-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-iinf 4621
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263
This theorem is referenced by:  frectfr  6455
  Copyright terms: Public domain W3C validator