Theorem ralrnmptw 7050

Description: A restricted quantifier over an image set. Version of ralrnmpt 7052 with a disjoint variable condition, which does not require ax-13 2377. (Contributed by Mario Carneiro, 20-Aug-2015.) Avoid ax-13 2377. (Revised by GG, 26-Jan-2024.)

Hypotheses

Ref	Expression
ralrnmptw.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
ralrnmptw.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
ralrnmptw	⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥 ∈ 𝐴 𝜒))

Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝑦,𝐵   𝜒,𝑦   𝑦,𝐹   𝜓,𝑥

Allowed substitution hints:   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑦)   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem ralrnmptw

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

Step	Hyp	Ref	Expression
1		ralrnmptw.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
2	1	fnmpt 6642	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → 𝐹 Fn 𝐴)
3		dfsbcq 3744	. . . . 5 ⊢ (𝑤 = (𝐹‘𝑧) → ([𝑤 / 𝑦]𝜓 ↔ [(𝐹‘𝑧) / 𝑦]𝜓))
4	3	ralrn 7044	. . . 4 ⊢ (𝐹 Fn 𝐴 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧 ∈ 𝐴 [(𝐹‘𝑧) / 𝑦]𝜓))
5	2, 4	syl 17	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑧 ∈ 𝐴 [(𝐹‘𝑧) / 𝑦]𝜓))
6		nfsbc1v 3762	. . . 4 ⊢ Ⅎ𝑦[𝑤 / 𝑦]𝜓
7		nfv 1916	. . . 4 ⊢ Ⅎ𝑤𝜓
8		sbceq2a 3754	. . . 4 ⊢ (𝑤 = 𝑦 → ([𝑤 / 𝑦]𝜓 ↔ 𝜓))
9	6, 7, 8	cbvralw 3280	. . 3 ⊢ (∀𝑤 ∈ ran 𝐹[𝑤 / 𝑦]𝜓 ↔ ∀𝑦 ∈ ran 𝐹𝜓)
10		nfmpt1 5199	. . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
11	1, 10	nfcxfr 2897	. . . . . 6 ⊢ Ⅎ𝑥𝐹
12		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥𝑧
13	11, 12	nffv 6854	. . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝑧)
14		nfv 1916	. . . . 5 ⊢ Ⅎ𝑥𝜓
15	13, 14	nfsbcw 3764	. . . 4 ⊢ Ⅎ𝑥[(𝐹‘𝑧) / 𝑦]𝜓
16		nfv 1916	. . . 4 ⊢ Ⅎ𝑧[(𝐹‘𝑥) / 𝑦]𝜓
17		fveq2 6844	. . . . 5 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
18	17	sbceq1d 3747	. . . 4 ⊢ (𝑧 = 𝑥 → ([(𝐹‘𝑧) / 𝑦]𝜓 ↔ [(𝐹‘𝑥) / 𝑦]𝜓))
19	15, 16, 18	cbvralw 3280	. . 3 ⊢ (∀𝑧 ∈ 𝐴 [(𝐹‘𝑧) / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝐴 [(𝐹‘𝑥) / 𝑦]𝜓)
20	5, 9, 19	3bitr3g 313	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥 ∈ 𝐴 [(𝐹‘𝑥) / 𝑦]𝜓))
21	1	fvmpt2 6963	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → (𝐹‘𝑥) = 𝐵)
22	21	sbceq1d 3747	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ([(𝐹‘𝑥) / 𝑦]𝜓 ↔ [𝐵 / 𝑦]𝜓))
23		ralrnmptw.2	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
24	23	sbcieg 3782	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → ([𝐵 / 𝑦]𝜓 ↔ 𝜒))
25	24	adantl 481	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ([𝐵 / 𝑦]𝜓 ↔ 𝜒))
26	22, 25	bitrd 279	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ([(𝐹‘𝑥) / 𝑦]𝜓 ↔ 𝜒))
27	26	ralimiaa 3074	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 ([(𝐹‘𝑥) / 𝑦]𝜓 ↔ 𝜒))
28		ralbi 3093	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ([(𝐹‘𝑥) / 𝑦]𝜓 ↔ 𝜒) → (∀𝑥 ∈ 𝐴 [(𝐹‘𝑥) / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝐴 𝜒))
29	27, 28	syl 17	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 [(𝐹‘𝑥) / 𝑦]𝜓 ↔ ∀𝑥 ∈ 𝐴 𝜒))
30	20, 29	bitrd 279	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑉 → (∀𝑦 ∈ ran 𝐹𝜓 ↔ ∀𝑥 ∈ 𝐴 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  [wsbc 3742   ↦ cmpt 5181  ran crn 5635   Fn wfn 6497  ‘cfv 6502

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 5245  ax-nul 5255  ax-pr 5381

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-sbc 3743  df-csb 3852  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-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-fv 6510

This theorem is referenced by:  rexrnmptw  7051  ac6num  10403  gsumwspan  18785  dfod2  19510  ordtbaslem  23149  ordtrest2lem  23164  cncmp  23353  comppfsc  23493  ptpjopn  23573  ordthmeolem  23762  tsmsfbas  24089  tsmsf1o  24106  prdsxmetlem  24329  prdsbl  24452  metdsf  24810  metdsge  24811  minveclem1  25397  minveclem3b  25401  minveclem6  25407  mbflimsup  25640  xrlimcnp  26951  minvecolem1  30968  minvecolem5  30975  minvecolem6  30976  ordtrest2NEWlem  34106  cvmsss2  35496  fin2so  37887  prdsbnd  38073  rrnequiv  38115  ralrnmpt3  45646