Theorem relopabi 5803

Description: A class of ordered pairs is a relation. (Contributed by Mario Carneiro, 21-Dec-2013.) Remove dependency on ax-sep 5251, ax-nul 5263, ax-pr 5398. (Revised by KP, 25-Oct-2021.)

Hypothesis

Ref	Expression
relopabi.1	⊢ 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Assertion

Ref	Expression
relopabi	⊢ Rel 𝐴

Proof of Theorem relopabi

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

Step	Hyp	Ref	Expression
1		relopabi.1	. . . . . . 7 ⊢ 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
2		df-opab 5168	. . . . . . 7 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
3	1, 2	eqtri 2783	. . . . . 6 ⊢ 𝐴 = {𝑧 ∣ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	3	eqabri 2902	. . . . 5 ⊢ (𝑧 ∈ 𝐴 ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5		simpl 488	. . . . . 6 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 = ⟨𝑥, 𝑦⟩)
6	5	2eximi 1869	. . . . 5 ⊢ (∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩)
7	4, 6	sylbi 220	. . . 4 ⊢ (𝑧 ∈ 𝐴 → ∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩)
8		ax6evr 2048	. . . . . . . . 9 ⊢ ∃𝑢 𝑦 = 𝑢
9		pm3.21 477	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ = 𝑧 → (𝑦 = 𝑢 → (𝑦 = 𝑢 ∧ ⟨𝑥, 𝑦⟩ = 𝑧)))
10	9	eximdv 1950	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ = 𝑧 → (∃𝑢 𝑦 = 𝑢 → ∃𝑢(𝑦 = 𝑢 ∧ ⟨𝑥, 𝑦⟩ = 𝑧)))
11	8, 10	mpi 21	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ = 𝑧 → ∃𝑢(𝑦 = 𝑢 ∧ ⟨𝑥, 𝑦⟩ = 𝑧))
12		opeq2 4834	. . . . . . . . . 10 ⊢ (𝑦 = 𝑢 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑢⟩)
13		eqtr2 2781	. . . . . . . . . . 11 ⊢ ((⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑢⟩ ∧ ⟨𝑥, 𝑦⟩ = 𝑧) → ⟨𝑥, 𝑢⟩ = 𝑧)
14	13	eqcomd 2766	. . . . . . . . . 10 ⊢ ((⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑢⟩ ∧ ⟨𝑥, 𝑦⟩ = 𝑧) → 𝑧 = ⟨𝑥, 𝑢⟩)
15	12, 14	sylan 592	. . . . . . . . 9 ⊢ ((𝑦 = 𝑢 ∧ ⟨𝑥, 𝑦⟩ = 𝑧) → 𝑧 = ⟨𝑥, 𝑢⟩)
16	15	eximi 1868	. . . . . . . 8 ⊢ (∃𝑢(𝑦 = 𝑢 ∧ ⟨𝑥, 𝑦⟩ = 𝑧) → ∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
17	11, 16	syl 18	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ = 𝑧 → ∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
18	17	eqcoms 2768	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
19	18	2eximi 1869	. . . . 5 ⊢ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ → ∃𝑥∃𝑦∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
20		excomim 2200	. . . . 5 ⊢ (∃𝑥∃𝑦∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩ → ∃𝑦∃𝑥∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
21	19, 20	syl 18	. . . 4 ⊢ (∃𝑥∃𝑦 𝑧 = ⟨𝑥, 𝑦⟩ → ∃𝑦∃𝑥∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩)
22		vex 3454	. . . . . . . . 9 ⊢ 𝑥 ∈ V
23		vex 3454	. . . . . . . . 9 ⊢ 𝑢 ∈ V
24	22, 23	pm3.2i 476	. . . . . . . 8 ⊢ (𝑥 ∈ V ∧ 𝑢 ∈ V)
25	24	jctr 534	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑢⟩ → (𝑧 = ⟨𝑥, 𝑢⟩ ∧ (𝑥 ∈ V ∧ 𝑢 ∈ V)))
26	25	2eximi 1869	. . . . . 6 ⊢ (∃𝑥∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩ → ∃𝑥∃𝑢(𝑧 = ⟨𝑥, 𝑢⟩ ∧ (𝑥 ∈ V ∧ 𝑢 ∈ V)))
27		df-xp 5661	. . . . . . . 8 ⊢ (V × V) = {⟨𝑥, 𝑢⟩ ∣ (𝑥 ∈ V ∧ 𝑢 ∈ V)}
28		df-opab 5168	. . . . . . . 8 ⊢ {⟨𝑥, 𝑢⟩ ∣ (𝑥 ∈ V ∧ 𝑢 ∈ V)} = {𝑧 ∣ ∃𝑥∃𝑢(𝑧 = ⟨𝑥, 𝑢⟩ ∧ (𝑥 ∈ V ∧ 𝑢 ∈ V))}
29	27, 28	eqtri 2783	. . . . . . 7 ⊢ (V × V) = {𝑧 ∣ ∃𝑥∃𝑢(𝑧 = ⟨𝑥, 𝑢⟩ ∧ (𝑥 ∈ V ∧ 𝑢 ∈ V))}
30	29	eqabri 2902	. . . . . 6 ⊢ (𝑧 ∈ (V × V) ↔ ∃𝑥∃𝑢(𝑧 = ⟨𝑥, 𝑢⟩ ∧ (𝑥 ∈ V ∧ 𝑢 ∈ V)))
31	26, 30	sylibr 237	. . . . 5 ⊢ (∃𝑥∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩ → 𝑧 ∈ (V × V))
32	31	eximi 1868	. . . 4 ⊢ (∃𝑦∃𝑥∃𝑢 𝑧 = ⟨𝑥, 𝑢⟩ → ∃𝑦 𝑧 ∈ (V × V))
33		ax5e 1945	. . . 4 ⊢ (∃𝑦 𝑧 ∈ (V × V) → 𝑧 ∈ (V × V))
34	7, 21, 32, 33	4syl 20	. . 3 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ (V × V))
35	34	ssriv 3935	. 2 ⊢ 𝐴 ⊆ (V × V)
36		df-rel 5662	. 2 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V))
37	35, 36	mpbir 234	1 ⊢ Rel 𝐴

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738  Vcvv 3450   ⊆ wss 3899  ⟨cop 4590  {copab 5167   × cxp 5653  Rel wrel 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5661  df-rel 5662

This theorem is used by:  relopab  5805  relttrcl  9694  erclwwlkrel  30490  erclwwlknrel  30539  relsucmap  39218