Theorem prclaxpr 46117

Description: A class that is closed under the pairing operation models the Axiom of Pairing ax-pr 5395. 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 3458	. . . . . 6 ⊢ 𝑤 ∈ V
2	1	elpr 4609	. . . . 5 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))
3	2	biimpri 231	. . . 4 ⊢ ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})
4	3	rgenw 3084	. . 3 ⊢ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})
5		eleq2 2853	. . . . . 6 ⊢ (𝑧 = {𝑥, 𝑦} → (𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}))
6	5	imbi2d 343	. . . . 5 ⊢ (𝑧 = {𝑥, 𝑦} → (((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) ↔ ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})))
7	6	ralbidv 3189	. . . 4 ⊢ (𝑧 = {𝑥, 𝑦} → (∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) ↔ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})))
8	7	rspcev 3580	. . 3 ⊢ (({𝑥, 𝑦} ∈ 𝑀 ∧ ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ {𝑥, 𝑦})) → ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
9	4, 8	mpan2 704	. 2 ⊢ ({𝑥, 𝑦} ∈ 𝑀 → ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
10	9	2ralimi 3136	1 ⊢ (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 {𝑥, 𝑦} ∈ 𝑀 → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∃𝑧 ∈ 𝑀 ∀𝑤 ∈ 𝑀 ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ∃wrex 3090  {cpr 4590

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-un 4154  df-sn 4589  df-pr 4591

This theorem is used by:  wfaxpr  46130