Theorem bnj1228 35408

Description: Existence of a minimal element in certain classes: if 𝑅 is well-founded and set-like on 𝐴, then every nonempty subclass of 𝐴 has a minimal element. The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj1228.1	⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵)

Assertion

Ref	Expression
bnj1228	⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

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

Allowed substitution hints:   𝐴(𝑥, 𝑤)   𝐵(𝑥)   𝑅(𝑤)

Proof of Theorem bnj1228

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj69 35407	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
2		nfv 1943	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)
3		bnj1228.1	. . . . . . 7 ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵)
4	3	nfcii 2913	. . . . . 6 ⊢ Ⅎ𝑥𝐵
5	4	nfcri 2916	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵
6		nfv 1943	. . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝑦𝑅𝑧
7	4, 6	nfralw 3311	. . . . 5 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧
8	5, 7	nfan 1928	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
9		eleq1w 2845	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵))
10		breq2 5112	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑧))
11	10	notbid 321	. . . . . 6 ⊢ (𝑥 = 𝑧 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝑧))
12	11	ralbidv 3187	. . . . 5 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧))
13	9, 12	anbi12d 643	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) ↔ (𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)))
14	2, 8, 13	cbvexv1 2373	. . 3 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧))
15		df-rex 3089	. . 3 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
16		df-rex 3089	. . 3 ⊢ (∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧 ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧))
17	14, 15, 16	3bitr4i 306	. 2 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
18	1, 17	sylibr 237	1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1102  ∀wal 1567  ∃wex 1808   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ∃wrex 3088   ⊆ wss 3904  ∅c0 4285   class class class wbr 5108   FrSe w-bnj15 35090

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-reg 9552  ax-inf2 9608

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7861  df-1o 8451  df-bnj17 35085  df-bnj14 35087  df-bnj13 35089  df-bnj15 35091  df-bnj18 35093  df-bnj19 35095

This theorem is used by:  bnj1204  35409  bnj1311  35421  bnj1312  35455