Theorem bj-xtagex 32977

Description: The product of a set and the tagging of a set is a set. (Contributed by BJ, 2-Apr-2019.)

Assertion

Ref	Expression
bj-xtagex	⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ 𝑊 → (𝐴 × tag 𝐵) ∈ V))

Proof of Theorem bj-xtagex

Step	Hyp	Ref	Expression
1		elex 3212	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
2		bj-tagex 32975	. . 3 ⊢ (𝐵 ∈ V ↔ tag 𝐵 ∈ V)
3	1, 2	sylib 208	. 2 ⊢ (𝐵 ∈ 𝑊 → tag 𝐵 ∈ V)
4		bj-xpexg2 32947	. 2 ⊢ (𝐴 ∈ 𝑉 → (tag 𝐵 ∈ V → (𝐴 × tag 𝐵) ∈ V))
5	3, 4	syl5 34	1 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ 𝑊 → (𝐴 × tag 𝐵) ∈ V))

Syntax hints:   → wi 4   ∈ wcel 1990  Vcvv 3200   × cxp 5112  tag bj-ctag 32962

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-opab 4713  df-xp 5120  df-rel 5121  df-bj-sngl 32954  df-bj-tag 32963

This theorem is referenced by:  bj-1uplex  32996  bj-2uplex  33010