Theorem bj-adjg1 37076

Description: Existence of the result of the adjunction (generalized only in the first term since this suffices for current applications). (Contributed by BJ, 19-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-adjg1	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∪ {𝑥}) ∈ V)

Proof of Theorem bj-adjg1

Dummy variables 𝑦 𝑧 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uneq1 4111	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 ∪ {𝑥}) = (𝐴 ∪ {𝑥}))
2	1	eleq1d 2816	. 2 ⊢ (𝑦 = 𝐴 → ((𝑦 ∪ {𝑥}) ∈ V ↔ (𝐴 ∪ {𝑥}) ∈ V))
3		ax-bj-adj 37075	. . . . 5 ⊢ ∀𝑦∀𝑥∃𝑧∀𝑡(𝑡 ∈ 𝑧 ↔ (𝑡 ∈ 𝑦 ∨ 𝑡 = 𝑥))
4	3	spi 2187	. . . 4 ⊢ ∀𝑥∃𝑧∀𝑡(𝑡 ∈ 𝑧 ↔ (𝑡 ∈ 𝑦 ∨ 𝑡 = 𝑥))
5	4	spi 2187	. . 3 ⊢ ∃𝑧∀𝑡(𝑡 ∈ 𝑧 ↔ (𝑡 ∈ 𝑦 ∨ 𝑡 = 𝑥))
6		bj-axadj 37074	. . 3 ⊢ ((𝑦 ∪ {𝑥}) ∈ V ↔ ∃𝑧∀𝑡(𝑡 ∈ 𝑧 ↔ (𝑡 ∈ 𝑦 ∨ 𝑡 = 𝑥)))
7	5, 6	mpbir 231	. 2 ⊢ (𝑦 ∪ {𝑥}) ∈ V
8	2, 7	vtoclg 3509	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∪ {𝑥}) ∈ V)

Syntax hints:   → wi 4   ↔ wb 206   ∨ wo 847  ∀wal 1539   = wceq 1541  ∃wex 1780   ∈ wcel 2111  Vcvv 3436   ∪ cun 3900  {csn 4576

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-12 2180  ax-ext 2703  ax-bj-adj 37075

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-v 3438  df-un 3907  df-sn 4577

This theorem is referenced by:  bj-snfromadj  37077  bj-prfromadj  37078