Theorem axprlem4OLD 5434

Description: Obsolete version of axprlem4 5431 as of 18-Sep-2025. (Contributed by Rohan Ridenour, 10-Aug-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
axprlem4OLD	⊢ ((∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥) → ∃𝑠(𝑠 ∈ 𝑝 ∧ if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))

Distinct variable groups:   𝑥,𝑠   𝑤,𝑠   𝑡,𝑛,𝑠

Proof of Theorem axprlem4OLD

Step	Hyp	Ref	Expression
1		axprlem1 5428	. . 3 ⊢ ∃𝑠∀𝑛(∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑛 ∈ 𝑠)
2	1	bm1.3iiOLD 5307	. 2 ⊢ ∃𝑠∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛)
3		nfa1 2148	. . . 4 ⊢ Ⅎ𝑠∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝)
4		nfv 1911	. . . 4 ⊢ Ⅎ𝑠 𝑤 = 𝑥
5	3, 4	nfan 1896	. . 3 ⊢ Ⅎ𝑠(∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥)
6		biimp 215	. . . . . . . . 9 ⊢ ((𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → (𝑛 ∈ 𝑠 → ∀𝑡 ¬ 𝑡 ∈ 𝑛))
7	6	alimi 1807	. . . . . . . 8 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → ∀𝑛(𝑛 ∈ 𝑠 → ∀𝑡 ¬ 𝑡 ∈ 𝑛))
8		df-ral 3059	. . . . . . . 8 ⊢ (∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 ↔ ∀𝑛(𝑛 ∈ 𝑠 → ∀𝑡 ¬ 𝑡 ∈ 𝑛))
9	7, 8	sylibr 234	. . . . . . 7 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → ∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛)
10		sp 2180	. . . . . . 7 ⊢ (∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) → (∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝))
11	9, 10	mpan9 506	. . . . . 6 ⊢ ((∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) ∧ ∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝)) → 𝑠 ∈ 𝑝)
12	11	adantrr 717	. . . . 5 ⊢ ((∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) ∧ (∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥)) → 𝑠 ∈ 𝑝)
13		ax-nul 5311	. . . . . . 7 ⊢ ∃𝑛∀𝑡 ¬ 𝑡 ∈ 𝑛
14		nfa1 2148	. . . . . . . 8 ⊢ Ⅎ𝑛∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛)
15		sp 2180	. . . . . . . . 9 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → (𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛))
16	15	biimprd 248	. . . . . . . 8 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → (∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑛 ∈ 𝑠))
17	14, 16	eximd 2213	. . . . . . 7 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → (∃𝑛∀𝑡 ¬ 𝑡 ∈ 𝑛 → ∃𝑛 𝑛 ∈ 𝑠))
18	13, 17	mpi 20	. . . . . 6 ⊢ (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → ∃𝑛 𝑛 ∈ 𝑠)
19		simprr 773	. . . . . 6 ⊢ ((∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) ∧ (∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥)) → 𝑤 = 𝑥)
20		ifptru 1074	. . . . . . 7 ⊢ (∃𝑛 𝑛 ∈ 𝑠 → (if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦) ↔ 𝑤 = 𝑥))
21	20	biimpar 477	. . . . . 6 ⊢ ((∃𝑛 𝑛 ∈ 𝑠 ∧ 𝑤 = 𝑥) → if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))
22	18, 19, 21	syl2an2r 685	. . . . 5 ⊢ ((∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) ∧ (∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥)) → if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))
23	12, 22	jca 511	. . . 4 ⊢ ((∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) ∧ (∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥)) → (𝑠 ∈ 𝑝 ∧ if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))
24	23	expcom 413	. . 3 ⊢ ((∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥) → (∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → (𝑠 ∈ 𝑝 ∧ if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))))
25	5, 24	eximd 2213	. 2 ⊢ ((∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥) → (∃𝑠∀𝑛(𝑛 ∈ 𝑠 ↔ ∀𝑡 ¬ 𝑡 ∈ 𝑛) → ∃𝑠(𝑠 ∈ 𝑝 ∧ if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))))
26	2, 25	mpi 20	1 ⊢ ((∀𝑠(∀𝑛 ∈ 𝑠 ∀𝑡 ¬ 𝑡 ∈ 𝑛 → 𝑠 ∈ 𝑝) ∧ 𝑤 = 𝑥) → ∃𝑠(𝑠 ∈ 𝑝 ∧ if-(∃𝑛 𝑛 ∈ 𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  if-wif 1062  ∀wal 1534  ∃wex 1775  ∀wral 3058

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-9 2115  ax-10 2138  ax-12 2174  ax-sep 5301  ax-nul 5311  ax-pow 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ifp 1063  df-tru 1539  df-ex 1776  df-nf 1780  df-ral 3059

This theorem is referenced by:  axprOLD  5436