Theorem 0setrec 51011

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 2763	. . 3 ⊢ setrecs(𝐹) = setrecs(𝐹)
2		ss0 4354	. . . . 5 ⊢ (𝑥 ⊆ ∅ → 𝑥 = ∅)
3		fveq2 6893	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐹‘𝑥) = (𝐹‘∅))
4		0setrec.1	. . . . . . 7 ⊢ (𝜑 → (𝐹‘∅) = ∅)
5	3, 4	sylan9eqr 2820	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝐹‘𝑥) = ∅)
6	5	ex 418	. . . . 5 ⊢ (𝜑 → (𝑥 = ∅ → (𝐹‘𝑥) = ∅))
7		eqimss 3970	. . . . 5 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘𝑥) ⊆ ∅)
8	2, 6, 7	syl56 37	. . . 4 ⊢ (𝜑 → (𝑥 ⊆ ∅ → (𝐹‘𝑥) ⊆ ∅))
9	8	alrimiv 1961	. . 3 ⊢ (𝜑 → ∀𝑥(𝑥 ⊆ ∅ → (𝐹‘𝑥) ⊆ ∅))
10	1, 9	setrec2v 9988	. 2 ⊢ (𝜑 → setrecs(𝐹) ⊆ ∅)
11		ss0 4354	. 2 ⊢ (setrecs(𝐹) ⊆ ∅ → setrecs(𝐹) = ∅)
12	10, 11	syl 18	1 ⊢ (𝜑 → setrecs(𝐹) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ⊆ wss 3899  ∅c0 4280  ‘cfv 6546  setrecscsetrecs 9974

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fv 6554  df-setrecs 9975

This theorem is used by: (None)