Theorem fnssintima 7302

Description: Condition for subset of an intersection of an image. (Contributed by Scott Fenton, 16-Aug-2024.)

Assertion

Ref	Expression
fnssintima	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐶 ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 𝐶 ⊆ (𝐹‘𝑥)))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem fnssintima

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssint 4914	. . 3 ⊢ (𝐶 ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑦 ∈ (𝐹 “ 𝐵)𝐶 ⊆ 𝑦)
2		df-ral 3049	. . 3 ⊢ (∀𝑦 ∈ (𝐹 “ 𝐵)𝐶 ⊆ 𝑦 ↔ ∀𝑦(𝑦 ∈ (𝐹 “ 𝐵) → 𝐶 ⊆ 𝑦))
3	1, 2	bitri 275	. 2 ⊢ (𝐶 ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑦(𝑦 ∈ (𝐹 “ 𝐵) → 𝐶 ⊆ 𝑦))
4		fvelimab 6900	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑦 ∈ (𝐹 “ 𝐵) ↔ ∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦))
5	4	imbi1d 341	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝑦 ∈ (𝐹 “ 𝐵) → 𝐶 ⊆ 𝑦) ↔ (∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦)))
6	5	albidv 1921	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∀𝑦(𝑦 ∈ (𝐹 “ 𝐵) → 𝐶 ⊆ 𝑦) ↔ ∀𝑦(∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦)))
7		ralcom4 3259	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ ∀𝑦∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦))
8		eqcom 2740	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
9	8	imbi1i 349	. . . . . . 7 ⊢ (((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ (𝑦 = (𝐹‘𝑥) → 𝐶 ⊆ 𝑦))
10	9	albii 1820	. . . . . 6 ⊢ (∀𝑦((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ ∀𝑦(𝑦 = (𝐹‘𝑥) → 𝐶 ⊆ 𝑦))
11		fvex 6841	. . . . . . 7 ⊢ (𝐹‘𝑥) ∈ V
12		sseq2 3957	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝑥) → (𝐶 ⊆ 𝑦 ↔ 𝐶 ⊆ (𝐹‘𝑥)))
13	11, 12	ceqsalv 3477	. . . . . 6 ⊢ (∀𝑦(𝑦 = (𝐹‘𝑥) → 𝐶 ⊆ 𝑦) ↔ 𝐶 ⊆ (𝐹‘𝑥))
14	10, 13	bitri 275	. . . . 5 ⊢ (∀𝑦((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ 𝐶 ⊆ (𝐹‘𝑥))
15	14	ralbii 3079	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ ∀𝑥 ∈ 𝐵 𝐶 ⊆ (𝐹‘𝑥))
16		r19.23v 3160	. . . . 5 ⊢ (∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ (∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦))
17	16	albii 1820	. . . 4 ⊢ (∀𝑦∀𝑥 ∈ 𝐵 ((𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ ∀𝑦(∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦))
18	7, 15, 17	3bitr3ri 302	. . 3 ⊢ (∀𝑦(∃𝑥 ∈ 𝐵 (𝐹‘𝑥) = 𝑦 → 𝐶 ⊆ 𝑦) ↔ ∀𝑥 ∈ 𝐵 𝐶 ⊆ (𝐹‘𝑥))
19	6, 18	bitrdi 287	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∀𝑦(𝑦 ∈ (𝐹 “ 𝐵) → 𝐶 ⊆ 𝑦) ↔ ∀𝑥 ∈ 𝐵 𝐶 ⊆ (𝐹‘𝑥)))
20	3, 19	bitrid 283	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐶 ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 𝐶 ⊆ (𝐹‘𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1539   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057   ⊆ wss 3898  ∩ cint 4897   “ cima 5622   Fn wfn 6481  ‘cfv 6486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-br 5094  df-opab 5156  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-fv 6494

This theorem is referenced by:  bday1s  27776  madebdaylemlrcut  27845