Theorem 0setrec 50796

Description: If a function sends the empty set to itself, the function will not recursively generate any sets, regardless of its other values. (Contributed by Emmett Weisz, 23-Jun-2021.)

Hypothesis

Ref	Expression
0setrec.1	⊢ (𝜑 → (𝐹‘∅) = ∅)

Assertion

Ref	Expression
0setrec	⊢ (𝜑 → setrecs(𝐹) = ∅)

Proof of Theorem 0setrec

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2761	. . 3 ⊢ setrecs(𝐹) = setrecs(𝐹)
2		ss0 4352	. . . . 5 ⊢ (𝑥 ⊆ ∅ → 𝑥 = ∅)
3		fveq2 6885	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐹‘𝑥) = (𝐹‘∅))
4		0setrec.1	. . . . . . 7 ⊢ (𝜑 → (𝐹‘∅) = ∅)
5	3, 4	sylan9eqr 2818	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝐹‘𝑥) = ∅)
6	5	ex 418	. . . . 5 ⊢ (𝜑 → (𝑥 = ∅ → (𝐹‘𝑥) = ∅))
7		eqimss 3989	. . . . 5 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘𝑥) ⊆ ∅)
8	2, 6, 7	syl56 37	. . . 4 ⊢ (𝜑 → (𝑥 ⊆ ∅ → (𝐹‘𝑥) ⊆ ∅))
9	8	alrimiv 1960	. . 3 ⊢ (𝜑 → ∀𝑥(𝑥 ⊆ ∅ → (𝐹‘𝑥) ⊆ ∅))
10	1, 9	setrec2v 9978	. 2 ⊢ (𝜑 → setrecs(𝐹) ⊆ ∅)
11		ss0 4352	. 2 ⊢ (setrecs(𝐹) ⊆ ∅ → setrecs(𝐹) = ∅)
12	10, 11	syl 18	1 ⊢ (𝜑 → setrecs(𝐹) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ⊆ wss 3899  ∅c0 4279  ‘cfv 6538  setrecscsetrecs 9964

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fv 6546  df-setrecs 9965

This theorem is used by: (None)