Theorem xrnss3v 39293

Description: A range Cartesian product is a subset of the class of ordered triples. This is Scott Fenton's txpss3v 36620 with a different symbol, see https://github.com/metamath/set.mm/issues/2469 36620. (Contributed by Scott Fenton, 31-Mar-2012.)

Assertion

Ref	Expression
xrnss3v	⊢ (𝐴 ⋉ 𝐵) ⊆ (V × (V × V))

Proof of Theorem xrnss3v

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-xrn 39292	. 2 ⊢ (𝐴 ⋉ 𝐵) = ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵))
2		inss1 4182	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵)) ⊆ (◡(1st ↾ (V × V)) ∘ 𝐴)
3		relco 6104	. . . 4 ⊢ Rel (◡(1st ↾ (V × V)) ∘ 𝐴)
4		vex 3455	. . . . . . . . 9 ⊢ 𝑧 ∈ V
5		vex 3455	. . . . . . . . 9 ⊢ 𝑦 ∈ V
6	4, 5	brcnv 5860	. . . . . . . 8 ⊢ (𝑧◡(1st ↾ (V × V))𝑦 ↔ 𝑦(1st ↾ (V × V))𝑧)
7	4	brresi 5979	. . . . . . . . 9 ⊢ (𝑦(1st ↾ (V × V))𝑧 ↔ (𝑦 ∈ (V × V) ∧ 𝑦1st 𝑧))
8	7	simplbi 502	. . . . . . . 8 ⊢ (𝑦(1st ↾ (V × V))𝑧 → 𝑦 ∈ (V × V))
9	6, 8	sylbi 220	. . . . . . 7 ⊢ (𝑧◡(1st ↾ (V × V))𝑦 → 𝑦 ∈ (V × V))
10	9	adantl 487	. . . . . 6 ⊢ ((𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦) → 𝑦 ∈ (V × V))
11	10	exlimiv 1963	. . . . 5 ⊢ (∃𝑧(𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦) → 𝑦 ∈ (V × V))
12		vex 3455	. . . . . 6 ⊢ 𝑥 ∈ V
13	12, 5	opelco 5849	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (◡(1st ↾ (V × V)) ∘ 𝐴) ↔ ∃𝑧(𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦))
14		opelxp 5687	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V × (V × V)) ↔ (𝑥 ∈ V ∧ 𝑦 ∈ (V × V)))
15	12, 14	mpbiran 722	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V × (V × V)) ↔ 𝑦 ∈ (V × V))
16	11, 13, 15	3imtr4i 295	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (◡(1st ↾ (V × V)) ∘ 𝐴) → ⟨𝑥, 𝑦⟩ ∈ (V × (V × V)))
17	3, 16	relssi 5763	. . 3 ⊢ (◡(1st ↾ (V × V)) ∘ 𝐴) ⊆ (V × (V × V))
18	2, 17	sstri 3940	. 2 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵)) ⊆ (V × (V × V))
19	1, 18	eqsstri 3977	1 ⊢ (𝐴 ⋉ 𝐵) ⊆ (V × (V × V))

This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ⟨cop 4590   class class class wbr 5103   × cxp 5649  ^◡ccnv 5650   ↾ cres 5653   ∘ ccom 5655  1^st c1st 7997  2^nd c2nd 7998   ⋉ cxrn 39086

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-ext 2733  ax-sep 5249  ax-pr 5391

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-res 5663  df-xrn 39292

This theorem is used by:  xrnrel  39294  brxrn2  39296