MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frsn Structured version   Visualization version   GIF version

Theorem frsn 5642
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.
StepHypRef Expression
1 snprc 4656 . . . . . 6 𝐴 ∈ V ↔ {𝐴} = ∅)
2 fr0 5537 . . . . . . 7 𝑅 Fr ∅
3 freq2 5529 . . . . . . 7 ({𝐴} = ∅ → (𝑅 Fr {𝐴} ↔ 𝑅 Fr ∅))
42, 3mpbiri 260 . . . . . 6 ({𝐴} = ∅ → 𝑅 Fr {𝐴})
51, 4sylbi 219 . . . . 5 𝐴 ∈ V → 𝑅 Fr {𝐴})
65adantl 484 . . . 4 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → 𝑅 Fr {𝐴})
7 brrelex1 5608 . . . . 5 ((Rel 𝑅𝐴𝑅𝐴) → 𝐴 ∈ V)
87stoic1a 1772 . . . 4 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐴𝑅𝐴)
96, 82thd 267 . . 3 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
109ex 415 . 2 (Rel 𝑅 → (¬ 𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴)))
11 df-fr 5517 . . . 4 (𝑅 Fr {𝐴} ↔ ∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
12 sssn 4762 . . . . . . . . . . 11 (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
13 neor 3111 . . . . . . . . . . 11 ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ↔ (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
1412, 13sylbb 221 . . . . . . . . . 10 (𝑥 ⊆ {𝐴} → (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
1514imp 409 . . . . . . . . 9 ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
1615adantl 484 . . . . . . . 8 ((𝐴 ∈ V ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → 𝑥 = {𝐴})
17 eqimss 4026 . . . . . . . . . 10 (𝑥 = {𝐴} → 𝑥 ⊆ {𝐴})
1817adantl 484 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ⊆ {𝐴})
19 snnzg 4713 . . . . . . . . . . 11 (𝐴 ∈ V → {𝐴} ≠ ∅)
20 neeq1 3081 . . . . . . . . . . 11 (𝑥 = {𝐴} → (𝑥 ≠ ∅ ↔ {𝐴} ≠ ∅))
2119, 20syl5ibrcom 249 . . . . . . . . . 10 (𝐴 ∈ V → (𝑥 = {𝐴} → 𝑥 ≠ ∅))
2221imp 409 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ≠ ∅)
2318, 22jca 514 . . . . . . . 8 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅))
2416, 23impbida 799 . . . . . . 7 (𝐴 ∈ V → ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) ↔ 𝑥 = {𝐴}))
2524imbi1d 344 . . . . . 6 (𝐴 ∈ V → (((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ (𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)))
2625albidv 1920 . . . . 5 (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∀𝑥(𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)))
27 snex 5335 . . . . . 6 {𝐴} ∈ V
28 raleq 3408 . . . . . . 7 (𝑥 = {𝐴} → (∀𝑧𝑥 ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
2928rexeqbi1dv 3407 . . . . . 6 (𝑥 = {𝐴} → (∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦 ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
3027, 29ceqsalv 3535 . . . . 5 (∀𝑥(𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦)
3126, 30syl6bb 289 . . . 4 (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
3211, 31syl5bb 285 . . 3 (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
33 breq2 5073 . . . . . 6 (𝑦 = 𝐴 → (𝑧𝑅𝑦𝑧𝑅𝐴))
3433notbid 320 . . . . 5 (𝑦 = 𝐴 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐴))
3534ralbidv 3200 . . . 4 (𝑦 = 𝐴 → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
3635rexsng 4617 . . 3 (𝐴 ∈ V → (∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
37 breq1 5072 . . . . 5 (𝑧 = 𝐴 → (𝑧𝑅𝐴𝐴𝑅𝐴))
3837notbid 320 . . . 4 (𝑧 = 𝐴 → (¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
3938ralsng 4616 . . 3 (𝐴 ∈ V → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
4032, 36, 393bitrd 307 . 2 (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
4110, 40pm2.61d2 183 1 (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  wal 1534   = wceq 1536  wcel 2113  wne 3019  wral 3141  wrex 3142  Vcvv 3497  wss 3939  c0 4294  {csn 4570   class class class wbr 5069   Fr wfr 5514  Rel wrel 5563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-br 5070  df-opab 5132  df-fr 5517  df-xp 5564  df-rel 5565
This theorem is referenced by:  wesn  5643
  Copyright terms: Public domain W3C validator