Theorem rexrnmpo 5992

Description: A restricted quantifier over an image set. (Contributed by Mario Carneiro, 1-Sep-2015.)

Hypotheses

Ref	Expression
rngop.1	⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
ralrnmpo.2	⊢ (𝑧 = 𝐶 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
rexrnmpo	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∃𝑧 ∈ ran 𝐹𝜑 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓))

Distinct variable groups:   𝑦,𝑧,𝐴   𝑧,𝐵   𝑧,𝐶   𝑧,𝐹   𝜓,𝑧   𝑥,𝑦,𝑧   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑧)   𝜓(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem rexrnmpo

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngop.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
2	1	rnmpo 5987	. . . 4 ⊢ ran 𝐹 = {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}
3	2	rexeqi 2678	. . 3 ⊢ (∃𝑧 ∈ ran 𝐹𝜑 ↔ ∃𝑧 ∈ {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}𝜑)
4		eqeq1 2184	. . . . 5 ⊢ (𝑤 = 𝑧 → (𝑤 = 𝐶 ↔ 𝑧 = 𝐶))
5	4	2rexbidv 2502	. . . 4 ⊢ (𝑤 = 𝑧 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶))
6	5	rexab 2901	. . 3 ⊢ (∃𝑧 ∈ {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}𝜑 ↔ ∃𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
7		rexcom4 2762	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑧∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
8		r19.41v 2633	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
9	8	exbii 1605	. . . 4 ⊢ (∃𝑧∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
10	7, 9	bitr2i 185	. . 3 ⊢ (∃𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
11	3, 6, 10	3bitri 206	. 2 ⊢ (∃𝑧 ∈ ran 𝐹𝜑 ↔ ∃𝑥 ∈ 𝐴 ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
12		rexcom4 2762	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑧∃𝑦 ∈ 𝐵 (𝑧 = 𝐶 ∧ 𝜑))
13		r19.41v 2633	. . . . . . 7 ⊢ (∃𝑦 ∈ 𝐵 (𝑧 = 𝐶 ∧ 𝜑) ↔ (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
14	13	exbii 1605	. . . . . 6 ⊢ (∃𝑧∃𝑦 ∈ 𝐵 (𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
15	12, 14	bitri 184	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑))
16		ralrnmpo.2	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝜑 ↔ 𝜓))
17	16	ceqsexgv 2868	. . . . . . 7 ⊢ (𝐶 ∈ 𝑉 → (∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ 𝜓))
18	17	ralimi 2540	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑦 ∈ 𝐵 (∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ 𝜓))
19		rexbi 2610	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 (∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ 𝜓) → (∃𝑦 ∈ 𝐵 ∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓))
20	18, 19	syl 14	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∃𝑦 ∈ 𝐵 ∃𝑧(𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓))
21	15, 20	bitr3id 194	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓))
22	21	ralimi 2540	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 (∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓))
23		rexbi 2610	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓) → (∃𝑥 ∈ 𝐴 ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓))
24	22, 23	syl 14	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∃𝑥 ∈ 𝐴 ∃𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓))
25	11, 24	bitrid 192	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∃𝑧 ∈ ran 𝐹𝜑 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  {cab 2163  ∀wral 2455  ∃wrex 2456  ran crn 4629   ∈ cmpo 5879

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-cnv 4636  df-dm 4638  df-rn 4639  df-oprab 5881  df-mpo 5882

This theorem is referenced by:  eltx  13844  txrest  13861  txlm  13864