Theorem frminex 5600

Description: If an element of a well-founded set satisfies a property 𝜑, then there is a minimal element that satisfies 𝜑. (Contributed by Jeff Madsen, 18-Jun-2010.) (Proof shortened by Mario Carneiro, 18-Nov-2016.)

Hypotheses

Ref	Expression
frminex.1	⊢ 𝐴 ∈ V
frminex.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
frminex	⊢ (𝑅 Fr 𝐴 → (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥))))

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

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem frminex

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rabn0 4320	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝜑)
2		frminex.1	. . . . 5 ⊢ 𝐴 ∈ V
3	2	rabex 5270	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V
4		ssrab2 4014	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴
5		fri 5579	. . . . . 6 ⊢ ((({𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V ∧ 𝑅 Fr 𝐴) ∧ ({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ {𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅)) → ∃𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ¬ 𝑦𝑅𝑧)
6		frminex.2	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
7	6	ralrab 3637	. . . . . . . 8 ⊢ (∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ¬ 𝑦𝑅𝑧 ↔ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑧))
8	7	rexbii 3088	. . . . . . 7 ⊢ (∃𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ¬ 𝑦𝑅𝑧 ↔ ∃𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑧))
9		breq2 5079	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑦𝑅𝑥))
10	9	notbid 320	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (¬ 𝑦𝑅𝑧 ↔ ¬ 𝑦𝑅𝑥))
11	10	imbi2d 342	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → ((𝜓 → ¬ 𝑦𝑅𝑧) ↔ (𝜓 → ¬ 𝑦𝑅𝑥)))
12	11	ralbidv 3164	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑧) ↔ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
13	12	rexrab2 3643	. . . . . . 7 ⊢ (∃𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑧) ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
14	8, 13	bitri 277	. . . . . 6 ⊢ (∃𝑧 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ¬ 𝑦𝑅𝑧 ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
15	5, 14	sylib 220	. . . . 5 ⊢ ((({𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V ∧ 𝑅 Fr 𝐴) ∧ ({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ {𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅)) → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
16	15	an4s 667	. . . 4 ⊢ ((({𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V ∧ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴) ∧ (𝑅 Fr 𝐴 ∧ {𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅)) → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
17	3, 4, 16	mpanl12 709	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ {𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅) → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥)))
18	17	ex 414	. 2 ⊢ (𝑅 Fr 𝐴 → ({𝑥 ∈ 𝐴 ∣ 𝜑} ≠ ∅ → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥))))
19	1, 18	biimtrrid 245	1 ⊢ (𝑅 Fr 𝐴 → (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → ¬ 𝑦𝑅𝑥))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 397   ∈ wcel 2121   ≠ wne 2936  ∀wral 3055  ∃wrex 3065  {crab 3393  Vcvv 3433   ⊆ wss 3885  ∅c0 4264   class class class wbr 5075   Fr wfr 5571

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-fr 5574

This theorem is referenced by: (None)