Theorem prclaxpr 45293

Description: A class that is closed under the pairing operation models the Axiom of Pairing ax-pr 5378. Lemma II.2.4(4) of [Kunen2] p. 111. (Contributed by Eric Schmidt, 29-Sep-2025.)

Assertion

Ref	Expression
prclaxpr	⊢ (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 {𝑥, 𝑦} ∈ 𝑀 → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))

Distinct variable groups:   𝑥,𝑧,𝑤   𝑦,𝑧,𝑤   𝑧,𝑀

Allowed substitution hints:   𝑀(𝑥,𝑦,𝑤)

Proof of Theorem prclaxpr

Step	Hyp	Ref	Expression
1		vex 3445	. . . . . 6 ⊢ 𝑤 ∈ V
2	1	elpr 4606	. . . . 5 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))
3	2	biimpri 228	. . . 4 ⊢ ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})
4	3	rgenw 3056	. . 3 ⊢ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})
5		eleq2 2826	. . . . . 6 ⊢ (𝑧 = {𝑥, 𝑦} → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}))
6	5	imbi2d 340	. . . . 5 ⊢ (𝑧 = {𝑥, 𝑦} → (((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) ↔ ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})))
7	6	ralbidv 3160	. . . 4 ⊢ (𝑧 = {𝑥, 𝑦} → (∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) ↔ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})))
8	7	rspcev 3577	. . 3 ⊢ (({𝑥, 𝑦} ∈ 𝑀 ∧ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})) → ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
9	4, 8	mpan2 692	. 2 ⊢ ({𝑥, 𝑦} ∈ 𝑀 → ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
10	9	2ralimi 3107	1 ⊢ (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 {𝑥, 𝑦} ∈ 𝑀 → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))

Syntax hints:   → wi 4   ∨ wo 848   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3061  {cpr 4583

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-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3062  df-v 3443  df-un 3907  df-sn 4582  df-pr 4584

This theorem is referenced by:  wfaxpr  45306