Theorem frd 5597

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 485	. . 3 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → 𝑧 = 𝐵)
2		biidd 261	. . . 4 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑥))
3	1, 2	raleqbidv 3317	. . 3 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
4	1, 3	rexeqbidv 3318	. 2 ⊢ ((𝜑 ∧ 𝑧 = 𝐵) → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
5		frd.ex	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
6		frd.ss	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝐴)
7	5, 6	elpwd 4571	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝒫 𝐴)
8		frd.n0	. . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅)
9		nelsn 4631	. . . 4 ⊢ (𝐵 ≠ ∅ → ¬ 𝐵 ∈ {∅})
10	8, 9	syl 17	. . 3 ⊢ (𝜑 → ¬ 𝐵 ∈ {∅})
11	7, 10	eldifd 3924	. 2 ⊢ (𝜑 → 𝐵 ∈ (𝒫 𝐴 ∖ {∅}))
12		frd.fr	. . 3 ⊢ (𝜑 → 𝑅 Fr 𝐴)
13		dffr6 5596	. . 3 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑧 ∈ (𝒫 𝐴 ∖ {∅})∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥)
14	12, 13	sylib 217	. 2 ⊢ (𝜑 → ∀𝑧 ∈ (𝒫 𝐴 ∖ {∅})∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥)
15	4, 11, 14	rspcdv2 3577	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106   ≠ wne 2939  ∀wral 3060  ∃wrex 3069   ∖ cdif 3910   ⊆ wss 3913  ∅c0 4287  𝒫 cpw 4565  {csn 4591   class class class wbr 5110   Fr wfr 5590

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1544  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-v 3448  df-dif 3916  df-in 3920  df-ss 3930  df-pw 4567  df-sn 4592  df-fr 5593

This theorem is referenced by:  fri  5598  frxp3  8088