Theorem ssrelrel 5796

Description: A subclass relationship determined by ordered triples. Use relrelss 6272 to express the antecedent in terms of the relation predicate. (Contributed by NM, 17-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
ssrelrel	⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

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

Proof of Theorem ssrelrel

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3975	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
2	1	alrimiv 1930	. . 3 ⊢ (𝐴 ⊆ 𝐵 → ∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
3	2	alrimivv 1931	. 2 ⊢ (𝐴 ⊆ 𝐵 → ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
4		elvvv 5751	. . . . . . . 8 ⊢ (𝑤 ∈ ((V × V) × V) ↔ ∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
5		eleq1 2821	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴))
6		eleq1 2821	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐵 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
7	5, 6	imbi12d 344	. . . . . . . . . . . . 13 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → ((𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
8	7	biimprcd 249	. . . . . . . . . . . 12 ⊢ ((⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
9	8	alimi 1813	. . . . . . . . . . 11 ⊢ (∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ∀𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
10		19.23v 1945	. . . . . . . . . . 11 ⊢ (∀𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)) ↔ (∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
11	9, 10	sylib 217	. . . . . . . . . 10 ⊢ (∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
12	11	2alimi 1814	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ∀𝑥∀𝑦(∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
13		19.23vv 1946	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦(∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)) ↔ (∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
14	12, 13	sylib 217	. . . . . . . 8 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
15	4, 14	biimtrid 241	. . . . . . 7 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 ∈ ((V × V) × V) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
16	15	com23 86	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 ∈ 𝐴 → (𝑤 ∈ ((V × V) × V) → 𝑤 ∈ 𝐵)))
17	16	a2d 29	. . . . 5 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ((𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
18	17	alimdv 1919	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)) → ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
19		dfss2 3968	. . . 4 ⊢ (𝐴 ⊆ ((V × V) × V) ↔ ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)))
20		dfss2 3968	. . . 4 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵))
21	18, 19, 20	3imtr4g 295	. . 3 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝐴 ⊆ ((V × V) × V) → 𝐴 ⊆ 𝐵))
22	21	com12 32	. 2 ⊢ (𝐴 ⊆ ((V × V) × V) → (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → 𝐴 ⊆ 𝐵))
23	3, 22	impbid2 225	1 ⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 205  ∀wal 1539   = wceq 1541  ∃wex 1781   ∈ wcel 2106  Vcvv 3474   ⊆ wss 3948  ⟨cop 4634   × cxp 5674

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-opab 5211  df-xp 5682

This theorem is referenced by:  eqrelrel  5797