Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dffr7 Structured version   Visualization version   GIF version

Theorem dffr7 36535
Description: Alternate quantifier-free definition of a well-founded relation. (Contributed by Scott Fenton, 26-Aug-2026.)
Assertion
Ref Expression
dffr7 (𝑅 Fr 𝐴 ↔ (𝒫 𝐴 ∖ {∅}) ⊆ Fix ( E ∘ (V ∖ (𝑅 E ))))

Proof of Theorem dffr7
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3454 . . . . 5 𝑥 ∈ V
21elfix 36480 . . . 4 (𝑥 Fix ( E ∘ (V ∖ (𝑅 E ))) ↔ 𝑥( E ∘ (V ∖ (𝑅 E )))𝑥)
31, 1coep 36331 . . . 4 (𝑥( E ∘ (V ∖ (𝑅 E )))𝑥 ↔ ∃𝑦𝑥 𝑥(V ∖ (𝑅 E ))𝑦)
4 vex 3454 . . . . . . . 8 𝑦 ∈ V
51, 4coepr 36332 . . . . . . 7 (𝑥(𝑅 E )𝑦 ↔ ∃𝑧𝑥 𝑧𝑅𝑦)
65notbii 323 . . . . . 6 𝑥(𝑅 E )𝑦 ↔ ¬ ∃𝑧𝑥 𝑧𝑅𝑦)
7 brv 5448 . . . . . . 7 𝑥V𝑦
8 brdif 5158 . . . . . . 7 (𝑥(V ∖ (𝑅 E ))𝑦 ↔ (𝑥V𝑦 ∧ ¬ 𝑥(𝑅 E )𝑦))
97, 8mpbiran 722 . . . . . 6 (𝑥(V ∖ (𝑅 E ))𝑦 ↔ ¬ 𝑥(𝑅 E )𝑦)
10 ralnex 3088 . . . . . 6 (∀𝑧𝑥 ¬ 𝑧𝑅𝑦 ↔ ¬ ∃𝑧𝑥 𝑧𝑅𝑦)
116, 9, 103bitr4i 306 . . . . 5 (𝑥(V ∖ (𝑅 E ))𝑦 ↔ ∀𝑧𝑥 ¬ 𝑧𝑅𝑦)
1211rexbii 3109 . . . 4 (∃𝑦𝑥 𝑥(V ∖ (𝑅 E ))𝑦 ↔ ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
132, 3, 123bitri 300 . . 3 (𝑥 Fix ( E ∘ (V ∖ (𝑅 E ))) ↔ ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
1413ralbii 3108 . 2 (∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})𝑥 Fix ( E ∘ (V ∖ (𝑅 E ))) ↔ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
15 dfss3 3920 . 2 ((𝒫 𝐴 ∖ {∅}) ⊆ Fix ( E ∘ (V ∖ (𝑅 E ))) ↔ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})𝑥 Fix ( E ∘ (V ∖ (𝑅 E ))))
16 dffr6 5611 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑥 ∈ (𝒫 𝐴 ∖ {∅})∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
1714, 15, 163bitr4ri 307 1 (𝑅 Fr 𝐴 ↔ (𝒫 𝐴 ∖ {∅}) ⊆ Fix ( E ∘ (V ∖ (𝑅 E ))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  wcel 2145  wral 3076  wrex 3086  Vcvv 3450  cdif 3896  wss 3899  c0 4279  𝒫 cpw 4557  {csn 4584   class class class wbr 5103   E cep 5554   Fr wfr 5605  ccnv 5654  ccom 5659   Fix cfix 36412
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5550  df-eprel 5555  df-fr 5608  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-fix 36436
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator