Theorem bj-xpnzexb 37844

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 37843	. 2 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → (𝐵 ∈ V → (𝐴 × 𝐵) ∈ V))
2		eldifsni 4753	. . 3 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → 𝐴 ≠ ∅)
3		bj-xpnzex 37842	. . 3 ⊢ (𝐴 ≠ ∅ → ((𝐴 × 𝐵) ∈ V → 𝐵 ∈ V))
4	2, 3	syl 18	. 2 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → ((𝐴 × 𝐵) ∈ V → 𝐵 ∈ V))
5	1, 4	impbid 215	1 ⊢ (𝐴 ∈ (𝑉 ∖ {∅}) → (𝐵 ∈ V ↔ (𝐴 × 𝐵) ∈ V))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451   ∖ cdif 3896  ∅c0 4279  {csn 4584   × cxp 5649

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-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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-ne 2957  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-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662

This theorem is used by: (None)