Users' Mathboxes Mathbox for Emmett Weisz < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  setrec1 Structured version   Visualization version   GIF version

Theorem setrec1 48007
Description: This is the first of two fundamental theorems about set recursion from which all other facts will be derived. It states that the class setrecs(𝐹) is closed under 𝐹. This effectively sets the actual value of setrecs(𝐹) as a lower bound for setrecs(𝐹), as it implies that any set generated by successive applications of 𝐹 is a member of 𝐵. This theorem "gets off the ground" because we can start by letting 𝐴 = ∅, and the hypotheses of the theorem will hold trivially.

Variable 𝐵 represents an abbreviation of setrecs(𝐹) or another name of setrecs(𝐹) (for an example of the latter, see theorem setrecon).

Proof summary: Assume that 𝐴𝐵, meaning that all elements of 𝐴 are in some set recursively generated by 𝐹. Then by setrec1lem3 48005, 𝐴 is a subset of some set recursively generated by 𝐹. (It turns out that 𝐴 itself is recursively generated by 𝐹, but we don't need this fact. See the comment to setrec1lem3 48005.) Therefore, by setrec1lem4 48006, (𝐹𝐴) is a subset of some set recursively generated by 𝐹. Thus, by ssuni 4929, it is a subset of the union of all sets recursively generated by 𝐹.

See df-setrecs 48000 for a detailed description of how the setrecs definition works.

(Contributed by Emmett Weisz, 9-Oct-2020.)

Hypotheses
Ref Expression
setrec1.b 𝐵 = setrecs(𝐹)
setrec1.v (𝜑𝐴 ∈ V)
setrec1.a (𝜑𝐴𝐵)
Assertion
Ref Expression
setrec1 (𝜑 → (𝐹𝐴) ⊆ 𝐵)

Proof of Theorem setrec1
Dummy variables 𝑎 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2726 . . . 4 {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)} = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}
2 setrec1.v . . . 4 (𝜑𝐴 ∈ V)
3 setrec1.a . . . . . . . . 9 (𝜑𝐴𝐵)
43sseld 3976 . . . . . . . 8 (𝜑 → (𝑎𝐴𝑎𝐵))
54imp 406 . . . . . . 7 ((𝜑𝑎𝐴) → 𝑎𝐵)
6 setrec1.b . . . . . . . 8 𝐵 = setrecs(𝐹)
7 df-setrecs 48000 . . . . . . . 8 setrecs(𝐹) = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}
86, 7eqtri 2754 . . . . . . 7 𝐵 = {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}
95, 8eleqtrdi 2837 . . . . . 6 ((𝜑𝑎𝐴) → 𝑎 {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
10 eluni 4905 . . . . . 6 (𝑎 {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)} ↔ ∃𝑥(𝑎𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
119, 10sylib 217 . . . . 5 ((𝜑𝑎𝐴) → ∃𝑥(𝑎𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
1211ralrimiva 3140 . . . 4 (𝜑 → ∀𝑎𝐴𝑥(𝑎𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
131, 2, 12setrec1lem3 48005 . . 3 (𝜑 → ∃𝑥(𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
14 nfv 1909 . . . . . . 7 𝑧𝜑
15 nfv 1909 . . . . . . . 8 𝑧 𝐴𝑥
16 nfaba1 2905 . . . . . . . . 9 𝑧{𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}
1716nfel2 2915 . . . . . . . 8 𝑧 𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}
1815, 17nfan 1894 . . . . . . 7 𝑧(𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
1914, 18nfan 1894 . . . . . 6 𝑧(𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
202adantr 480 . . . . . 6 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → 𝐴 ∈ V)
21 simprl 768 . . . . . 6 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → 𝐴𝑥)
22 simprr 770 . . . . . 6 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → 𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
2319, 1, 20, 21, 22setrec1lem4 48006 . . . . 5 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → (𝑥 ∪ (𝐹𝐴)) ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
24 ssun2 4168 . . . . 5 (𝐹𝐴) ⊆ (𝑥 ∪ (𝐹𝐴))
2523, 24jctil 519 . . . 4 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → ((𝐹𝐴) ⊆ (𝑥 ∪ (𝐹𝐴)) ∧ (𝑥 ∪ (𝐹𝐴)) ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}))
26 ssuni 4929 . . . 4 (((𝐹𝐴) ⊆ (𝑥 ∪ (𝐹𝐴)) ∧ (𝑥 ∪ (𝐹𝐴)) ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)}) → (𝐹𝐴) ⊆ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
2725, 26syl 17 . . 3 ((𝜑 ∧ (𝐴𝑥𝑥 ∈ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})) → (𝐹𝐴) ⊆ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
2813, 27exlimddv 1930 . 2 (𝜑 → (𝐹𝐴) ⊆ {𝑦 ∣ ∀𝑧(∀𝑤(𝑤𝑦 → (𝑤𝑧 → (𝐹𝑤) ⊆ 𝑧)) → 𝑦𝑧)})
2928, 8sseqtrrdi 4028 1 (𝜑 → (𝐹𝐴) ⊆ 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wal 1531   = wceq 1533  wex 1773  wcel 2098  {cab 2703  Vcvv 3468  cun 3941  wss 3943   cuni 4902  cfv 6537  setrecscsetrecs 47999
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722  ax-reg 9589  ax-inf2 9638
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-int 4944  df-iun 4992  df-iin 4993  df-br 5142  df-opab 5204  df-mpt 5225  df-tr 5259  df-id 5567  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-pred 6294  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7408  df-om 7853  df-2nd 7975  df-frecs 8267  df-wrecs 8298  df-recs 8372  df-rdg 8411  df-r1 9761  df-rank 9762  df-setrecs 48000
This theorem is referenced by:  elsetrecslem  48015  elsetrecs  48016  setrecsss  48017  setrecsres  48018  vsetrec  48019  onsetrec  48024
  Copyright terms: Public domain W3C validator