Theorem bj-prex 37771

Description: Existence of unordered pairs proved from ax-bj-sn 37764 and ax-bj-bun 37768. (Contributed by BJ, 12-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-prex	⊢ {𝐴, 𝐵} ∈ V

Proof of Theorem bj-prex

Step	Hyp	Ref	Expression
1		df-pr 4590	. 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
2		bj-snex 37766	. . 3 ⊢ {𝐴} ∈ V
3		bj-snex 37766	. . 3 ⊢ {𝐵} ∈ V
4		bj-unexg 37769	. . 3 ⊢ (({𝐴} ∈ V ∧ {𝐵} ∈ V) → ({𝐴} ∪ {𝐵}) ∈ V)
5	2, 3, 4	mp2an 705	. 2 ⊢ ({𝐴} ∪ {𝐵}) ∈ V
6	1, 5	eqeltri 2858	1 ⊢ {𝐴, 𝐵} ∈ V

This proof depends on syntax axioms:   ∈ wcel 2145  Vcvv 3453   ∪ cun 3900  {csn 4587  {cpr 4589

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-12 2215  ax-ext 2734  ax-nul 5267  ax-bj-sn 37764  ax-bj-bun 37768

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-dif 3905  df-un 3907  df-nul 4283  df-sn 4588  df-pr 4590

This theorem is used by: (None)