Theorem ralrnmpt2 6673

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem ralrnmpt2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rngop.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
2	1	rnmpt2 6668	. . . 4 ⊢ ran 𝐹 = {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}
3	2	raleqi 3119	. . 3 ⊢ (∀𝑧 ∈ ran 𝐹𝜑 ↔ ∀𝑧 ∈ {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}𝜑)
4		eqeq1 2614	. . . . 5 ⊢ (𝑤 = 𝑧 → (𝑤 = 𝐶 ↔ 𝑧 = 𝐶))
5	4	2rexbidv 3039	. . . 4 ⊢ (𝑤 = 𝑧 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶))
6	5	ralab 3334	. . 3 ⊢ (∀𝑧 ∈ {𝑤 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑤 = 𝐶}𝜑 ↔ ∀𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
7		ralcom4 3197	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑧∀𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
8		r19.23v 3005	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
9	8	albii 1737	. . . 4 ⊢ (∀𝑧∀𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
10	7, 9	bitr2i 264	. . 3 ⊢ (∀𝑧(∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
11	3, 6, 10	3bitri 285	. 2 ⊢ (∀𝑧 ∈ ran 𝐹𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
12		ralcom4 3197	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ ∀𝑧∀𝑦 ∈ 𝐵 (𝑧 = 𝐶 → 𝜑))
13		r19.23v 3005	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐵 (𝑧 = 𝐶 → 𝜑) ↔ (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
14	13	albii 1737	. . . . . 6 ⊢ (∀𝑧∀𝑦 ∈ 𝐵 (𝑧 = 𝐶 → 𝜑) ↔ ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
15	12, 14	bitri 263	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑))
16		nfv 1830	. . . . . . . 8 ⊢ Ⅎ𝑧𝜓
17		ralrnmpt2.2	. . . . . . . 8 ⊢ (𝑧 = 𝐶 → (𝜑 ↔ 𝜓))
18	16, 17	ceqsalg 3203	. . . . . . 7 ⊢ (𝐶 ∈ 𝑉 → (∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ 𝜓))
19	18	ralimi 2936	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑦 ∈ 𝐵 (∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ 𝜓))
20		ralbi 3050	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 (∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ 𝜓) → (∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ ∀𝑦 ∈ 𝐵 𝜓))
21	19, 20	syl 17	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 → 𝜑) ↔ ∀𝑦 ∈ 𝐵 𝜓))
22	15, 21	syl5bbr 273	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑦 ∈ 𝐵 𝜓))
23	22	ralimi 2936	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 (∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑦 ∈ 𝐵 𝜓))
24		ralbi 3050	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑦 ∈ 𝐵 𝜓) → (∀𝑥 ∈ 𝐴 ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓))
25	23, 24	syl 17	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 ∀𝑧(∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓))
26	11, 25	syl5bb 271	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑧 ∈ ran 𝐹𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓))

Syntax hints:   → wi 4   ↔ wb 195  ∀wal 1473   = wceq 1475   ∈ wcel 1977  {cab 2596  ∀wral 2896  ∃wrex 2897  ran crn 5039   ↦ cmpt2 6551

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-cnv 5046  df-dm 5048  df-rn 5049  df-oprab 6553  df-mpt2 6554

This theorem is referenced by:  rexrnmpt2  6674  efgval2  17960  txcnp  21233  txcnmpt  21237  txflf  21620