Theorem bj-xpnzexb 37268

Description: If the first factor of a product is a nonempty set, then the product is a set if and only if the second factor is a set. (Contributed by BJ, 2-Apr-2019.)

Assertion

Ref	Expression
bj-xpnzexb	⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → (𝐵 ∈ V ↔ (𝐴 × 𝐵) ∈ V))

Proof of Theorem bj-xpnzexb

Step	Hyp	Ref	Expression
1		bj-xpexg2 37267	. 2 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → (𝐵 ∈ V → (𝐴 × 𝐵) ∈ V))
2		eldifsni 4735	. . 3 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → 𝐴 ≠ ∅)
3		bj-xpnzex 37266	. . 3 ⊢ (𝐴 ≠ ∅ → ((𝐴 × 𝐵) ∈ V → 𝐵 ∈ V))
4	2, 3	syl 17	. 2 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → ((𝐴 × 𝐵) ∈ V → 𝐵 ∈ V))
5	1, 4	impbid 212	1 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → (𝐵 ∈ V ↔ (𝐴 × 𝐵) ∈ V))

Syntax hints:   → wi 4   ↔ wb 206   ∈ wcel 2114   ≠ wne 2932  Vcvv 3429   ∖ cdif 3886  ∅c0 4273  {csn 4567   × cxp 5629

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-cnv 5639  df-dm 5641  df-rn 5642

This theorem is referenced by: (None)