Theorem xrnss3v 38566

Description: A range Cartesian product is a subset of the class of ordered triples. This is Scott Fenton's txpss3v 36070 with a different symbol, see https://github.com/metamath/set.mm/issues/2469 36070. (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 38565	. 2 ⊢ (𝐴 ⋉ 𝐵) = ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵))
2		inss1 4189	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵)) ⊆ (◡(1st ↾ (V × V)) ∘ 𝐴)
3		relco 6067	. . . 4 ⊢ Rel (◡(1st ↾ (V × V)) ∘ 𝐴)
4		vex 3444	. . . . . . . . 9 ⊢ 𝑧 ∈ V
5		vex 3444	. . . . . . . . 9 ⊢ 𝑦 ∈ V
6	4, 5	brcnv 5831	. . . . . . . 8 ⊢ (𝑧◡(1st ↾ (V × V))𝑦 ↔ 𝑦(1st ↾ (V × V))𝑧)
7	4	brresi 5947	. . . . . . . . 9 ⊢ (𝑦(1st ↾ (V × V))𝑧 ↔ (𝑦 ∈ (V × V) ∧ 𝑦1st 𝑧))
8	7	simplbi 497	. . . . . . . 8 ⊢ (𝑦(1st ↾ (V × V))𝑧 → 𝑦 ∈ (V × V))
9	6, 8	sylbi 217	. . . . . . 7 ⊢ (𝑧◡(1st ↾ (V × V))𝑦 → 𝑦 ∈ (V × V))
10	9	adantl 481	. . . . . 6 ⊢ ((𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦) → 𝑦 ∈ (V × V))
11	10	exlimiv 1931	. . . . 5 ⊢ (∃𝑧(𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦) → 𝑦 ∈ (V × V))
12		vex 3444	. . . . . 6 ⊢ 𝑥 ∈ V
13	12, 5	opelco 5820	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (◡(1st ↾ (V × V)) ∘ 𝐴) ↔ ∃𝑧(𝑥𝐴𝑧 ∧ 𝑧◡(1st ↾ (V × V))𝑦))
14		opelxp 5660	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V × (V × V)) ↔ (𝑥 ∈ V ∧ 𝑦 ∈ (V × V)))
15	12, 14	mpbiran 709	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (V × (V × V)) ↔ 𝑦 ∈ (V × V))
16	11, 13, 15	3imtr4i 292	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ (◡(1st ↾ (V × V)) ∘ 𝐴) → ⟨𝑥, 𝑦⟩ ∈ (V × (V × V)))
17	3, 16	relssi 5736	. . 3 ⊢ (◡(1st ↾ (V × V)) ∘ 𝐴) ⊆ (V × (V × V))
18	2, 17	sstri 3943	. 2 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝐵)) ⊆ (V × (V × V))
19	1, 18	eqsstri 3980	1 ⊢ (𝐴 ⋉ 𝐵) ⊆ (V × (V × V))

Syntax hints:   ∧ wa 395  ∃wex 1780   ∈ wcel 2113  Vcvv 3440   ∩ cin 3900   ⊆ wss 3901  ⟨cop 4586   class class class wbr 5098   × cxp 5622  ^◡ccnv 5623   ↾ cres 5626   ∘ ccom 5628  1^st c1st 7931  2^nd c2nd 7932   ⋉ cxrn 38375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-res 5636  df-xrn 38565

This theorem is referenced by:  xrnrel  38567  brxrn2  38569