Theorem eloprabga 7512

Description: The law of concretion for operation class abstraction. Compare elopab 5520. (Contributed by NM, 14-Sep-1999.) Remove unnecessary distinct variable conditions. (Revised by David Abernethy, 19-Jun-2012.) (Revised by Mario Carneiro, 19-Dec-2013.) Avoid ax-10 2129, ax-11 2146. (Revised by Wolf Lammen, 15-Oct-2024.)

Hypothesis

Ref	Expression
eloprabga.1	⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
eloprabga	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓))

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

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)   𝑊(𝑥,𝑦,𝑧)   𝑋(𝑥,𝑦,𝑧)

Proof of Theorem eloprabga

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3487	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2		elex 3487	. 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
3		elex 3487	. 2 ⊢ (𝐶 ∈ 𝑋 → 𝐶 ∈ V)
4		opex 5457	. . 3 ⊢ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ V
5		simpr 484	. . . . . . . . . 10 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩)
6	5	eqeq1d 2728	. . . . . . . . 9 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩))
7		eqcom 2733	. . . . . . . . . 10 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩)
8		vex 3472	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
9		vex 3472	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
10		vex 3472	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
11	8, 9, 10	otth2 5476	. . . . . . . . . 10 ⊢ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶))
12	7, 11	bitri 275	. . . . . . . . 9 ⊢ (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶))
13	6, 12	bitrdi 287	. . . . . . . 8 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶)))
14	13	anbi1d 629	. . . . . . 7 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜑)))
15		eloprabga.1	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓))
16	15	pm5.32i 574	. . . . . . 7 ⊢ (((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓))
17	14, 16	bitrdi 287	. . . . . 6 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓)))
18	17	3exbidv 1920	. . . . 5 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓)))
19		df-oprab 7409	. . . . . . . . 9 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
20	19	eleq2i 2819	. . . . . . . 8 ⊢ (𝑤 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝑤 ∈ {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)})
21		abid 2707	. . . . . . . 8 ⊢ (𝑤 ∈ {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} ↔ ∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
22	20, 21	bitr2i 276	. . . . . . 7 ⊢ (∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ 𝑤 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
23		eleq1 2815	. . . . . . 7 ⊢ (𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ → (𝑤 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}))
24	22, 23	bitrid 283	. . . . . 6 ⊢ (𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ → (∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}))
25	24	adantl 481	. . . . 5 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (∃𝑥∃𝑦∃𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}))
26		19.41vvv 1947	. . . . . . 7 ⊢ (∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓) ↔ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓))
27		elisset 2809	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → ∃𝑥 𝑥 = 𝐴)
28		elisset 2809	. . . . . . . . . 10 ⊢ (𝐵 ∈ V → ∃𝑦 𝑦 = 𝐵)
29		elisset 2809	. . . . . . . . . 10 ⊢ (𝐶 ∈ V → ∃𝑧 𝑧 = 𝐶)
30	27, 28, 29	3anim123i 1148	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶))
31		3exdistr 1956	. . . . . . . . . . 11 ⊢ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ↔ ∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)))
32		19.41v 1945	. . . . . . . . . . 11 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)))
33		19.41v 1945	. . . . . . . . . . . 12 ⊢ (∃𝑦(𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶) ↔ (∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶))
34	33	anbi2i 622	. . . . . . . . . . 11 ⊢ ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦(𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)) ↔ (∃𝑥 𝑥 = 𝐴 ∧ (∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)))
35	31, 32, 34	3bitri 297	. . . . . . . . . 10 ⊢ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ↔ (∃𝑥 𝑥 = 𝐴 ∧ (∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)))
36		3anass 1092	. . . . . . . . . 10 ⊢ ((∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶) ↔ (∃𝑥 𝑥 = 𝐴 ∧ (∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)))
37	35, 36	bitr4i 278	. . . . . . . . 9 ⊢ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶))
38	30, 37	sylibr 233	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → ∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶))
39	38	biantrurd 532	. . . . . . 7 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝜓 ↔ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓)))
40	26, 39	bitr4id 290	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓) ↔ 𝜓))
41	40	adantr 480	. . . . 5 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (∃𝑥∃𝑦∃𝑧((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ∧ 𝜓) ↔ 𝜓))
42	18, 25, 41	3bitr3d 309	. . . 4 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓))
43	42	expcom 413	. . 3 ⊢ (𝑤 = ⟨⟨𝐴, 𝐵⟩, 𝐶⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓)))
44	4, 43	vtocle 3538	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓))
45	1, 2, 3, 44	syl3an 1157	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1084   = wceq 1533  ∃wex 1773   ∈ wcel 2098  {cab 2703  Vcvv 3468  ⟨cop 4629  {coprab 7406

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-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-oprab 7409

This theorem is referenced by:  eloprabg  7514  ovigg  7549  vdwpc  16922  elmpps  35092  uncov  36982  brrabga  37723