Theorem bj-gabima 35808

Description: Generalized class abstraction as a direct image.

TODO: improve the support lemmas elimag 6061 and fvelima 6954 to nonfreeness hypothesis (and for the latter, biconditional). (Contributed by BJ, 4-Oct-2024.)

Hypotheses

Ref	Expression
bj-gabima.nf	⊢ (𝜑 → ∀𝑥𝜑)
bj-gabima.nff	⊢ (𝜑 → Ⅎ𝑥𝐹)
bj-gabima.fun	⊢ (𝜑 → Fun 𝐹)
bj-gabima.dm	⊢ (𝜑 → {𝑥 ∣ 𝜓} ⊆ dom 𝐹)

Assertion

Ref	Expression
bj-gabima	⊢ (𝜑 → {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} = (𝐹 “ {𝑥 ∣ 𝜓}))

Proof of Theorem bj-gabima

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-gabima.nf	. . . 4 ⊢ (𝜑 → ∀𝑥𝜑)
2		nfcvd 2904	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝑦)
3		vex 3478	. . . . 5 ⊢ 𝑦 ∈ V
4	3	a1i 11	. . . 4 ⊢ (𝜑 → 𝑦 ∈ V)
5		df-rex 3071	. . . . . 6 ⊢ (∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦 ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
6	5	a1i 11	. . . . 5 ⊢ (𝜑 → (∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦 ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦)))
7		eqcom 2739	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑧) ↔ (𝐹‘𝑧) = 𝑦)
8		df-clab 2710	. . . . . . . . 9 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜓} ↔ [𝑧 / 𝑥]𝜓)
9	8	bicomi 223	. . . . . . . 8 ⊢ ([𝑧 / 𝑥]𝜓 ↔ 𝑧 ∈ {𝑥 ∣ 𝜓})
10	7, 9	anbi12ci 628	. . . . . . 7 ⊢ ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
11	10	exbii 1850	. . . . . 6 ⊢ (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
12	11	a1i 11	. . . . 5 ⊢ (𝜑 → (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦)))
13	1	nf5i 2142	. . . . . 6 ⊢ Ⅎ𝑥𝜑
14		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑦
15	14	a1i 11	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥𝑦)
16		bj-gabima.nff	. . . . . . . . 9 ⊢ (𝜑 → Ⅎ𝑥𝐹)
17		nfcv 2903	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑧
18	17	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → Ⅎ𝑥𝑧)
19	16, 18	nffvd 6900	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝐹‘𝑧))
20	15, 19	nfeqd 2913	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = (𝐹‘𝑧))
21		nfs1v 2153	. . . . . . . 8 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜓
22	21	a1i 11	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥[𝑧 / 𝑥]𝜓)
23	20, 22	nfand 1900	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓))
24		fveq2 6888	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
25	24	eqeq2d 2743	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
26		sbequ12r 2244	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ([𝑧 / 𝑥]𝜓 ↔ 𝜓))
27	25, 26	anbi12d 631	. . . . . . 7 ⊢ (𝑧 = 𝑥 → ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑦 = (𝐹‘𝑥) ∧ 𝜓)))
28	27	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑧 = 𝑥 → ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑦 = (𝐹‘𝑥) ∧ 𝜓))))
29	13, 23, 28	cbvexdw 2335	. . . . 5 ⊢ (𝜑 → (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑥(𝑦 = (𝐹‘𝑥) ∧ 𝜓)))
30	6, 12, 29	3bitr2rd 307	. . . 4 ⊢ (𝜑 → (∃𝑥(𝑦 = (𝐹‘𝑥) ∧ 𝜓) ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
31	1, 2, 4, 30	bj-elgab 35807	. . 3 ⊢ (𝜑 → (𝑦 ∈ {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
32		bj-gabima.fun	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
33	32	funfnd 6576	. . . 4 ⊢ (𝜑 → 𝐹 Fn dom 𝐹)
34		bj-gabima.dm	. . . 4 ⊢ (𝜑 → {𝑥 ∣ 𝜓} ⊆ dom 𝐹)
35	33, 34	fvelimabd 6962	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐹 “ {𝑥 ∣ 𝜓}) ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
36	31, 35	bitr4d 281	. 2 ⊢ (𝜑 → (𝑦 ∈ {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} ↔ 𝑦 ∈ (𝐹 “ {𝑥 ∣ 𝜓})))
37	36	eqrdv 2730	1 ⊢ (𝜑 → {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} = (𝐹 “ {𝑥 ∣ 𝜓}))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1539   = wceq 1541  ∃wex 1781  Ⅎwnf 1785  [wsb 2067   ∈ wcel 2106  {cab 2709  Ⅎwnfc 2883  ∃wrex 3070  Vcvv 3474   ⊆ wss 3947  dom cdm 5675   “ cima 5678  Fun wfun 6534  ‘cfv 6540  {bj-cgab 35801

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-fv 6548  df-bj-gab 35802

This theorem is referenced by: (None)