Theorem ssrel 3253

Description: A subclass relationship depends only on a relation's ordered pairs. Theorem 3.2(i) of [Monk1] p. 33.

Assertion

Ref	Expression
ssrel	⊢ (Rel A → (A ⊆ B ↔ ∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B)))

Distinct variable groups:   x,y,A   x,B,y

Proof of Theorem ssrel

Step	Hyp	Ref	Expression
1		ssel 2066	. . . . 5 ⊢ (A ⊆ B → (⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B))
2	1	a1i 8	. . . 4 ⊢ (Rel A → (A ⊆ B → (⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B)))
3	2	19.21adv 1290	. . 3 ⊢ (Rel A → (A ⊆ B → ∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B)))
4	3	19.21adv 1290	. 2 ⊢ (Rel A → (A ⊆ B → ∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B)))
5		df-rel 3191	. . . . . . . 8 ⊢ (Rel A ↔ A ⊆ (V × V))
6		ssel 2066	. . . . . . . 8 ⊢ (A ⊆ (V × V) → (z ∈ A → z ∈ (V × V)))
7	5, 6	sylbi 199	. . . . . . 7 ⊢ (Rel A → (z ∈ A → z ∈ (V × V)))
8		elvv 3234	. . . . . . 7 ⊢ (z ∈ (V × V) ↔ ∃x∃y z = ⟨x, y⟩)
9	7, 8	syl6ib 212	. . . . . 6 ⊢ (Rel A → (z ∈ A → ∃x∃y z = ⟨x, y⟩))
10		id 59	. . . . . . . . . . . . . 14 ⊢ ((⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B))
11	10	anim2d 563	. . . . . . . . . . . . 13 ⊢ ((⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ((z = ⟨x, y⟩ ⋀ ⟨x, y⟩ ∈ A) → (z = ⟨x, y⟩ ⋀ ⟨x, y⟩ ∈ B)))
12		eleq1 1537	. . . . . . . . . . . . . 14 ⊢ (z = ⟨x, y⟩ → (z ∈ B ↔ ⟨x, y⟩ ∈ B))
13	12	biimpar 419	. . . . . . . . . . . . 13 ⊢ ((z = ⟨x, y⟩ ⋀ ⟨x, y⟩ ∈ B) → z ∈ B)
14	11, 13	syl6 22	. . . . . . . . . . . 12 ⊢ ((⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ((z = ⟨x, y⟩ ⋀ ⟨x, y⟩ ∈ A) → z ∈ B))
15		eleq1 1537	. . . . . . . . . . . . 13 ⊢ (z = ⟨x, y⟩ → (z ∈ A ↔ ⟨x, y⟩ ∈ A))
16	15	pm5.32i 647	. . . . . . . . . . . 12 ⊢ ((z = ⟨x, y⟩ ⋀ z ∈ A) ↔ (z = ⟨x, y⟩ ⋀ ⟨x, y⟩ ∈ A))
17	14, 16	syl5ib 206	. . . . . . . . . . 11 ⊢ ((⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ((z = ⟨x, y⟩ ⋀ z ∈ A) → z ∈ B))
18	17	exp3a 376	. . . . . . . . . 10 ⊢ ((⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
19	18	19.20i 994	. . . . . . . . 9 ⊢ (∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ∀y(z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
20		19.23v 1295	. . . . . . . . 9 ⊢ (∀y(z = ⟨x, y⟩ → (z ∈ A → z ∈ B)) ↔ (∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
21	19, 20	sylib 198	. . . . . . . 8 ⊢ (∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
22	21	19.20i 994	. . . . . . 7 ⊢ (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ∀x(∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
23		19.23v 1295	. . . . . . 7 ⊢ (∀x(∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)) ↔ (∃x∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
24	22, 23	sylib 198	. . . . . 6 ⊢ (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (∃x∃y z = ⟨x, y⟩ → (z ∈ A → z ∈ B)))
25	9, 24	syl9 57	. . . . 5 ⊢ (Rel A → (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (z ∈ A → (z ∈ A → z ∈ B))))
26		pm2.43 63	. . . . 5 ⊢ ((z ∈ A → (z ∈ A → z ∈ B)) → (z ∈ A → z ∈ B))
27	25, 26	syl6 22	. . . 4 ⊢ (Rel A → (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → (z ∈ A → z ∈ B)))
28	27	19.21adv 1290	. . 3 ⊢ (Rel A → (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → ∀z(z ∈ A → z ∈ B)))
29		dfss2 2061	. . 3 ⊢ (A ⊆ B ↔ ∀z(z ∈ A → z ∈ B))
30	28, 29	syl6ibr 213	. 2 ⊢ (Rel A → (∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B) → A ⊆ B))
31	4, 30	impbid 518	1 ⊢ (Rel A → (A ⊆ B ↔ ∀x∀y(⟨x, y⟩ ∈ A → ⟨x, y⟩ ∈ B)))

Syntax hints:   → wi 3   ↔ wb 146   ⋀ wa 223  ∀wal 956   = wceq 958   ∈ wcel 960  ∃wex 982  Vcvv 1814   ⊆ wss 2050  ⟨cop 2415   × cxp 3174  Rel wrel 3181

This theorem is referenced by:  relssi 3254  relssdv 3255  eqrel 3256  intasym 3444

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-opab 2672  df-xp 3190  df-rel 3191

Copyright terms: Public domain