Metamath Proof Explorer


Theorem bj-prexg

Description: Existence of unordered pairs formed on sets, proved from ax-bj-sn and ax-bj-bun . Contrary to bj-prex , this proof is intuitionistically valid and does not require ax-nul . (Contributed by BJ, 12-Jan-2025) (Proof modification is discouraged.)

Ref Expression
Assertion bj-prexg ⊢ A ∈ V ∧ B ∈ W → A B ∈ V

Proof

Step Hyp Ref Expression
1 df-pr ⊢ A B = A ∪ B
2 bj-snexg ⊢ A ∈ V → A ∈ V
3 bj-snexg ⊢ B ∈ W → B ∈ V
4 bj-unexg ⊢ A ∈ V ∧ B ∈ V → A ∪ B ∈ V
5 2 3 4 syl2an ⊢ A ∈ V ∧ B ∈ W → A ∪ B ∈ V
6 1 5 eqeltrid ⊢ A ∈ V ∧ B ∈ W → A B ∈ V