Theorem frsn 5706

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 4649	. . . . . 6 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
2		fr0 5596	. . . . . . 7 ⊢ 𝑅 Fr ∅
3		freq2 5586	. . . . . . 7 ⊢ ({𝐴} = ∅ → (𝑅 Fr {𝐴} ↔ 𝑅 Fr ∅))
4	2, 3	mpbiri 259	. . . . . 6 ⊢ ({𝐴} = ∅ → 𝑅 Fr {𝐴})
5	1, 4	sylbi 218	. . . . 5 ⊢ (¬ 𝐴 ∈ V → 𝑅 Fr {𝐴})
6	5	adantl 482	. . . 4 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → 𝑅 Fr {𝐴})
7		brrelex1 5671	. . . . 5 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐴) → 𝐴 ∈ V)
8	7	stoic1a 1779	. . . 4 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐴𝑅𝐴)
9	6, 8	2thd 266	. . 3 ⊢ ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
10	9	ex 413	. 2 ⊢ (Rel 𝑅 → (¬ 𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴)))
11		df-fr 5571	. . . 4 ⊢ (𝑅 Fr {𝐴} ↔ ∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦))
12		sssn 4757	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
13		neor 3026	. . . . . . . . . . 11 ⊢ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ↔ (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
14	12, 13	sylbb 220	. . . . . . . . . 10 ⊢ (𝑥 ⊆ {𝐴} → (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
15	14	imp 407	. . . . . . . . 9 ⊢ ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
16	15	adantl 482	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → 𝑥 = {𝐴})
17		eqimss 3973	. . . . . . . . . 10 ⊢ (𝑥 = {𝐴} → 𝑥 ⊆ {𝐴})
18	17	adantl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ⊆ {𝐴})
19		snnzg 4706	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → {𝐴} ≠ ∅)
20		neeq1 2996	. . . . . . . . . . 11 ⊢ (𝑥 = {𝐴} → (𝑥 ≠ ∅ ↔ {𝐴} ≠ ∅))
21	19, 20	syl5ibrcom 248	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → (𝑥 = {𝐴} → 𝑥 ≠ ∅))
22	21	imp 407	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ≠ ∅)
23	18, 22	jca 516	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅))
24	16, 23	impbida 806	. . . . . . 7 ⊢ (𝐴 ∈ V → ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) ↔ 𝑥 = {𝐴}))
25	24	imbi1d 342	. . . . . 6 ⊢ (𝐴 ∈ V → (((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ (𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦)))
26	25	albidv 1927	. . . . 5 ⊢ (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∀𝑥(𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦)))
27		snex 5368	. . . . . 6 ⊢ {𝐴} ∈ V
28		raleq 3294	. . . . . . 7 ⊢ (𝑥 = {𝐴} → (∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
29	28	rexeqbi1dv 3308	. . . . . 6 ⊢ (𝑥 = {𝐴} → (∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦 ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
30	27, 29	ceqsalv 3470	. . . . 5 ⊢ (∀𝑥(𝑥 = {𝐴} → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦)
31	26, 30	bitrdi 288	. . . 4 ⊢ (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑧 ∈ 𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
32	11, 31	bitrid 284	. . 3 ⊢ (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
33		breq2 5076	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐴))
34	33	notbid 319	. . . . 5 ⊢ (𝑦 = 𝐴 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐴))
35	34	ralbidv 3162	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
36	35	rexsng 4608	. . 3 ⊢ (𝐴 ∈ V → (∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
37		breq1 5075	. . . . 5 ⊢ (𝑧 = 𝐴 → (𝑧𝑅𝐴 ↔ 𝐴𝑅𝐴))
38	37	notbid 319	. . . 4 ⊢ (𝑧 = 𝐴 → (¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
39	38	ralsng 4607	. . 3 ⊢ (𝐴 ∈ V → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
40	32, 36, 39	3bitrd 306	. 2 ⊢ (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
41	10, 40	pm2.61d2 182	1 ⊢ (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 853  ∀wal 1545   = wceq 1547   ∈ wcel 2119   ≠ wne 2934  ∀wral 3053  ∃wrex 3063  Vcvv 3431   ⊆ wss 3883  ∅c0 4261  {csn 4555   class class class wbr 5072   Fr wfr 5568  Rel wrel 5623

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-opab 5135  df-fr 5571  df-xp 5624  df-rel 5625

This theorem is referenced by:  wesn  5707