Theorem bj-gabima 37192

Description: Generalized class abstraction as a direct image.

TODO: improve the support lemmas elimag 6031 and fvelima 6907 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 2900	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝑦)
3		vex 3446	. . . . 5 ⊢ 𝑦 ∈ V
4	3	a1i 11	. . . 4 ⊢ (𝜑 → 𝑦 ∈ V)
5		df-rex 3063	. . . . . 6 ⊢ (∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦 ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
6	5	a1i 11	. . . . 5 ⊢ (𝜑 → (∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦 ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦)))
7		eqcom 2744	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑧) ↔ (𝐹‘𝑧) = 𝑦)
8		df-clab 2716	. . . . . . . . 9 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜓} ↔ [𝑧 / 𝑥]𝜓)
9	8	bicomi 224	. . . . . . . 8 ⊢ ([𝑧 / 𝑥]𝜓 ↔ 𝑧 ∈ {𝑥 ∣ 𝜓})
10	7, 9	anbi12ci 630	. . . . . . 7 ⊢ ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
11	10	exbii 1850	. . . . . 6 ⊢ (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦))
12	11	a1i 11	. . . . 5 ⊢ (𝜑 → (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑧(𝑧 ∈ {𝑥 ∣ 𝜓} ∧ (𝐹‘𝑧) = 𝑦)))
13	1	nf5i 2152	. . . . . 6 ⊢ Ⅎ𝑥𝜑
14		nfcv 2899	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑦
15	14	a1i 11	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥𝑦)
16		bj-gabima.nff	. . . . . . . . 9 ⊢ (𝜑 → Ⅎ𝑥𝐹)
17		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑧
18	17	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → Ⅎ𝑥𝑧)
19	16, 18	nffvd 6854	. . . . . . . 8 ⊢ (𝜑 → Ⅎ𝑥(𝐹‘𝑧))
20	15, 19	nfeqd 2910	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = (𝐹‘𝑧))
21		nfs1v 2162	. . . . . . . 8 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜓
22	21	a1i 11	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑥[𝑧 / 𝑥]𝜓)
23	20, 22	nfand 1899	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓))
24		fveq2 6842	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
25	24	eqeq2d 2748	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐹‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
26		sbequ12r 2260	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ([𝑧 / 𝑥]𝜓 ↔ 𝜓))
27	25, 26	anbi12d 633	. . . . . . 7 ⊢ (𝑧 = 𝑥 → ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑦 = (𝐹‘𝑥) ∧ 𝜓)))
28	27	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑧 = 𝑥 → ((𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ (𝑦 = (𝐹‘𝑥) ∧ 𝜓))))
29	13, 23, 28	cbvexdw 2344	. . . . 5 ⊢ (𝜑 → (∃𝑧(𝑦 = (𝐹‘𝑧) ∧ [𝑧 / 𝑥]𝜓) ↔ ∃𝑥(𝑦 = (𝐹‘𝑥) ∧ 𝜓)))
30	6, 12, 29	3bitr2rd 308	. . . 4 ⊢ (𝜑 → (∃𝑥(𝑦 = (𝐹‘𝑥) ∧ 𝜓) ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
31	1, 2, 4, 30	bj-elgab 37191	. . 3 ⊢ (𝜑 → (𝑦 ∈ {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
32		bj-gabima.fun	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
33	32	funfnd 6531	. . . 4 ⊢ (𝜑 → 𝐹 Fn dom 𝐹)
34		bj-gabima.dm	. . . 4 ⊢ (𝜑 → {𝑥 ∣ 𝜓} ⊆ dom 𝐹)
35	33, 34	fvelimabd 6915	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐹 “ {𝑥 ∣ 𝜓}) ↔ ∃𝑧 ∈ {𝑥 ∣ 𝜓} (𝐹‘𝑧) = 𝑦))
36	31, 35	bitr4d 282	. 2 ⊢ (𝜑 → (𝑦 ∈ {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} ↔ 𝑦 ∈ (𝐹 “ {𝑥 ∣ 𝜓})))
37	36	eqrdv 2735	1 ⊢ (𝜑 → {(𝐹‘𝑥) ∣ 𝑥 ∣ 𝜓} = (𝐹 “ {𝑥 ∣ 𝜓}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wex 1781  Ⅎwnf 1785  [wsb 2068   ∈ wcel 2114  {cab 2715  Ⅎwnfc 2884  ∃wrex 3062  Vcvv 3442   ⊆ wss 3903  dom cdm 5632   “ cima 5635  Fun wfun 6494  ‘cfv 6500  {bj-cgab 37185

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-fv 6508  df-bj-gab 37186

This theorem is referenced by: (None)