Theorem mpo2eqb 7559

Description: Bidirectional equality theorem for a mapping abstraction. Equivalent to eqfnov2 7557. (Contributed by Mario Carneiro, 4-Jan-2017.)

Assertion

Ref	Expression
mpo2eqb	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝐷))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem mpo2eqb

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-mpo 7431	. . . 4 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)}
2		df-mpo 7431	. . . 4 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)}
3	1, 2	eqeq12i 2746	. . 3 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) ↔ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)})
4		eqoprab2bw 7496	. . 3 ⊢ ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)} ↔ ∀𝑥∀𝑦∀𝑧(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)))
5		pm5.32 572	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 ↔ 𝑧 = 𝐷)) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)))
6	5	albii 1813	. . . . . 6 ⊢ (∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 ↔ 𝑧 = 𝐷)) ↔ ∀𝑧(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)))
7		19.21v 1934	. . . . . 6 ⊢ (∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 ↔ 𝑧 = 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
8	6, 7	bitr3i 276	. . . . 5 ⊢ (∀𝑧(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
9	8	2albii 1814	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
10		r2al 3192	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
11	9, 10	bitr4i 277	. . 3 ⊢ (∀𝑥∀𝑦∀𝑧(((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐷)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷))
12	3, 4, 11	3bitri 296	. 2 ⊢ ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷))
13		pm13.183 3656	. . . . . 6 ⊢ (𝐶 ∈ 𝑉 → (𝐶 = 𝐷 ↔ ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
14	13	ralimi 3080	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑦 ∈ 𝐵 (𝐶 = 𝐷 ↔ ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
15		ralbi 3100	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 (𝐶 = 𝐷 ↔ ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)) → (∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
16	14, 15	syl 17	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
17	16	ralimi 3080	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
18		ralbi 3100	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
19	17, 18	syl 17	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝐷 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧(𝑧 = 𝐶 ↔ 𝑧 = 𝐷)))
20	12, 19	bitr4id 289	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝑉 → ((𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 = 𝐷))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394  ∀wal 1531   = wceq 1533   ∈ wcel 2098  ∀wral 3058  {coprab 7427   ∈ cmpo 7428

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-oprab 7430  df-mpo 7431

This theorem is referenced by:  homfeq  17681  comfeq  17693  2arymaptf1  47804