Theorem frsn 5748

Description: Founded relation on a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.) (Revised by Mario Carneiro, 23-Apr-2015.)

Assertion

Ref	Expression
frsn	⊢ (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))

Proof of Theorem frsn

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		snprc 4682	. . . . . 6 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
2		fr0 5638	. . . . . . 7 ⊢ 𝑅 Fr ∅
3		freq2 5628	. . . . . . 7 ⊢ ({𝐴} = ∅ → (𝑅 Fr {𝐴} ↔ 𝑅 Fr ∅))
4	2, 3	mpbiri 261	. . . . . 6 ⊢ ({𝐴} = ∅ → 𝑅 Fr {𝐴})
5	1, 4	sylbi 220	. . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝑅 Fr {𝐴})
6	5	adantl 486	. . . 4 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → 𝑅 Fr {𝐴})
7		brrelex1 5713	. . . . 5 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐴) → 𝐴 ∈ V)
8	7	stoic1a 1801	. . . 4 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐴𝑅𝐴)
9	6, 8	2thd 268	. . 3 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
10	9	ex 417	. 2 ⊢ (Rel 𝑅 → (¬ 𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴)))
11		df-fr 5613	. . . 4 ⊢ (𝑅 Fr {𝐴} ↔ ∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦))
12		sssn 4791	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
13		neor 3049	. . . . . . . . . . 11 ⊢ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ↔ (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
14	12, 13	sylbb 222	. . . . . . . . . 10 ⊢ (𝑥 ⊆ {𝐴} → (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
15	14	imp 411	. . . . . . . . 9 ⊢ ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
16	15	adantl 486	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → 𝑥 = {𝐴})
17		eqimss 3994	. . . . . . . . . 10 ⊢ (𝑥 = {𝐴} → 𝑥 ⊆ {𝐴})
18	17	adantl 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ⊆ {𝐴})
19		snnzg 4739	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → {𝐴} ≠ ∅)
20		neeq1 3019	. . . . . . . . . . 11 ⊢ (𝑥 = {𝐴} → (𝑥 ≠ ∅ ↔ {𝐴} ≠ ∅))
21	19, 20	syl5ibrcom 250	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → (𝑥 = {𝐴} → 𝑥 ≠ ∅))
22	21	imp 411	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ≠ ∅)
23	18, 22	jca 520	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅))
24	16, 23	impbida 812	. . . . . . 7 ⊢ (𝐴 ∈ V → ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) ↔ 𝑥 = {𝐴}))
25	24	imbi1d 344	. . . . . 6 ⊢ (𝐴 ∈ V → (((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ (𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦)))
26	25	albidv 1949	. . . . 5 ⊢ (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∀𝑥(𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦)))
27		snex 5409	. . . . . 6 ⊢ {𝐴} ∈ V
28		raleq 3319	. . . . . . 7 ⊢ (𝑥 = {𝐴} → (∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
29	28	rexeqbi1dv 3333	. . . . . 6 ⊢ (𝑥 = {𝐴} → (∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦 ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
30	27, 29	ceqsalv 3493	. . . . 5 ⊢ (∀𝑥(𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦)
31	26, 30	bitrdi 290	. . . 4 ⊢ (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
32	11, 31	bitrid 286	. . 3 ⊢ (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
33		breq2 5112	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐴))
34	33	notbid 321	. . . . 5 ⊢ (𝑦 = 𝐴 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐴))
35	34	ralbidv 3187	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
36	35	rexsng 4641	. . 3 ⊢ (𝐴 ∈ V → (∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
37		breq1 5111	. . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧𝑅𝐴 ↔ 𝐴𝑅𝐴))
38	37	notbid 321	. . . 4 ⊢ (𝑧 = 𝐴 → (¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
39	38	ralsng 4640	. . 3 ⊢ (𝐴 ∈ V → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
40	32, 36, 39	3bitrd 308	. 2 ⊢ (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
41	10, 40	pm2.61d2 183	1 ⊢ (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860  ∀wal 1567   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  Vcvv 3454   ⊆ wss 3904  ∅c0 4285  {csn 4588   class class class wbr 5108   Fr wfr 5610  Rel wrel 5665

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-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-fr 5613  df-xp 5666  df-rel 5667

This theorem is used by:  wesn  5749