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

Theorem frsn 5112
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 4197 . . . . . 6 𝐴 ∈ V ↔ {𝐴} = ∅)
2 fr0 5017 . . . . . . 7 𝑅 Fr ∅
3 freq2 5009 . . . . . . 7 ({𝐴} = ∅ → (𝑅 Fr {𝐴} ↔ 𝑅 Fr ∅))
42, 3mpbiri 247 . . . . . 6 ({𝐴} = ∅ → 𝑅 Fr {𝐴})
51, 4sylbi 206 . . . . 5 𝐴 ∈ V → 𝑅 Fr {𝐴})
65adantl 481 . . . 4 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → 𝑅 Fr {𝐴})
7 brrelex 5080 . . . . 5 ((Rel 𝑅𝐴𝑅𝐴) → 𝐴 ∈ V)
87stoic1a 1688 . . . 4 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → ¬ 𝐴𝑅𝐴)
96, 82thd 254 . . 3 ((Rel 𝑅 ∧ ¬ 𝐴 ∈ V) → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
109ex 449 . 2 (Rel 𝑅 → (¬ 𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴)))
11 df-fr 4997 . . . 4 (𝑅 Fr {𝐴} ↔ ∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
12 sssn 4298 . . . . . . . . . . 11 (𝑥 ⊆ {𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
13 neor 2873 . . . . . . . . . . 11 ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ↔ (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
1412, 13sylbb 208 . . . . . . . . . 10 (𝑥 ⊆ {𝐴} → (𝑥 ≠ ∅ → 𝑥 = {𝐴}))
1514imp 444 . . . . . . . . 9 ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → 𝑥 = {𝐴})
1615adantl 481 . . . . . . . 8 ((𝐴 ∈ V ∧ (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅)) → 𝑥 = {𝐴})
17 eqimss 3620 . . . . . . . . . 10 (𝑥 = {𝐴} → 𝑥 ⊆ {𝐴})
1817adantl 481 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ⊆ {𝐴})
19 snnzg 4251 . . . . . . . . . . 11 (𝐴 ∈ V → {𝐴} ≠ ∅)
20 neeq1 2844 . . . . . . . . . . 11 (𝑥 = {𝐴} → (𝑥 ≠ ∅ ↔ {𝐴} ≠ ∅))
2119, 20syl5ibrcom 236 . . . . . . . . . 10 (𝐴 ∈ V → (𝑥 = {𝐴} → 𝑥 ≠ ∅))
2221imp 444 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → 𝑥 ≠ ∅)
2318, 22jca 553 . . . . . . . 8 ((𝐴 ∈ V ∧ 𝑥 = {𝐴}) → (𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅))
2416, 23impbida 873 . . . . . . 7 (𝐴 ∈ V → ((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) ↔ 𝑥 = {𝐴}))
2524imbi1d 330 . . . . . 6 (𝐴 ∈ V → (((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ (𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)))
2625albidv 1836 . . . . 5 (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∀𝑥(𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)))
27 snex 4835 . . . . . 6 {𝐴} ∈ V
28 raleq 3115 . . . . . . 7 (𝑥 = {𝐴} → (∀𝑧𝑥 ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
2928rexeqbi1dv 3124 . . . . . 6 (𝑥 = {𝐴} → (∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦 ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
3027, 29ceqsalv 3206 . . . . 5 (∀𝑥(𝑥 = {𝐴} → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦)
3126, 30syl6bb 275 . . . 4 (𝐴 ∈ V → (∀𝑥((𝑥 ⊆ {𝐴} ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦) ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
3211, 31syl5bb 271 . . 3 (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦))
33 breq2 4587 . . . . . 6 (𝑦 = 𝐴 → (𝑧𝑅𝑦𝑧𝑅𝐴))
3433notbid 307 . . . . 5 (𝑦 = 𝐴 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐴))
3534ralbidv 2969 . . . 4 (𝑦 = 𝐴 → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
3635rexsng 4166 . . 3 (𝐴 ∈ V → (∃𝑦 ∈ {𝐴}∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴))
37 breq1 4586 . . . . 5 (𝑧 = 𝐴 → (𝑧𝑅𝐴𝐴𝑅𝐴))
3837notbid 307 . . . 4 (𝑧 = 𝐴 → (¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
3938ralsng 4165 . . 3 (𝐴 ∈ V → (∀𝑧 ∈ {𝐴} ¬ 𝑧𝑅𝐴 ↔ ¬ 𝐴𝑅𝐴))
4032, 36, 393bitrd 293 . 2 (𝐴 ∈ V → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
4110, 40pm2.61d2 171 1 (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wo 382  wa 383  wal 1473   = wceq 1475  wcel 1977  wne 2780  wral 2896  wrex 2897  Vcvv 3173  wss 3540  c0 3874  {csn 4125   class class class wbr 4583   Fr wfr 4994  Rel wrel 5043
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-fr 4997  df-xp 5044  df-rel 5045
This theorem is referenced by:  wesn  5113
  Copyright terms: Public domain W3C validator