Theorem frd 5607

Description: A nonempty subset of an 𝑅-well-founded class has an 𝑅-minimal element (deduction form). (Contributed by BJ, 16-Nov-2024.)

Hypotheses

Ref	Expression
frd.fr	⊢ (𝜑 → 𝑅 Fr 𝐴)
frd.ss	⊢ (𝜑 → 𝐵 ⊆ 𝐴)
frd.ex	⊢ (𝜑 → 𝐵 ∈ 𝑉)
frd.n0	⊢ (𝜑 → 𝐵 ≠ ∅)

Assertion

Ref	Expression
frd	⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦

Allowed substitution hints:   𝑉(𝑥, 𝑦)

Proof of Theorem frd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → 𝑧 = 𝐵)
2		biidd 265	. . . 4 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑥))
3	1, 2	raleqbidv 3334	. . 3 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
4	1, 3	rexeqbidv 3335	. 2 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
5		frd.ex	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
6		frd.ss	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
7	5, 6	elpwd 4562	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝒫 𝐴)
8		frd.n0	. . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅)
9		nelsn 4623	. . . 4 ⊢ (𝐵 ≠ ∅ → ¬ 𝐵 ∈ {∅})
10	8, 9	syl 18	. . 3 ⊢ (𝜑 → ¬ 𝐵 ∈ {∅})
11	7, 10	eldifd 4050	. 2 ⊢ (𝜑 → 𝐵 ∈ (𝒫 𝐴 ∖ {∅}))
12		frd.fr	. . 3 ⊢ (𝜑 → 𝑅 Fr 𝐴)
13		dffr6 5606	. . 3 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑧 ∈ (𝒫 𝐴 ∖ {∅})∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥)
14	12, 13	sylib 221	. 2 ⊢ (𝜑 → ∀𝑧 ∈ (𝒫 𝐴 ∖ {∅})∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥)
15	4, 11, 14	rspcdv2 3571	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   ∖ cdif 4045  ∅c0 4278  𝒫 cpw 4556  {csn 4584   class class class wbr 5102   Fr wfr 5600

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3896  df-dif 4047  df-pw 4558  df-sn 4585  df-fr 5603

This theorem is used by:  fri  5608  frxp3  8170  weiunfr  37347