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

Theorem wfrdmclOLD 8119
Description: Obsolete proof of wfrdmcl 8133 as of 17-Nov-2024. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 21-Apr-2011.)
Hypothesis
Ref Expression
wfrlem6OLD.1 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
Assertion
Ref Expression
wfrdmclOLD (𝑋 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝐹)

Proof of Theorem wfrdmclOLD
Dummy variables 𝑓 𝑔 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wfrlem6OLD.1 . . . . . . . 8 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
2 dfwrecsOLD 8100 . . . . . . . 8 wrecs(𝑅, 𝐴, 𝐺) = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
31, 2eqtri 2766 . . . . . . 7 𝐹 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
43dmeqi 5802 . . . . . 6 dom 𝐹 = dom {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
5 dmuni 5812 . . . . . 6 dom {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔
64, 5eqtri 2766 . . . . 5 dom 𝐹 = 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔
76eleq2i 2830 . . . 4 (𝑋 ∈ dom 𝐹𝑋 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔)
8 eliun 4925 . . . 4 (𝑋 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔 ↔ ∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}𝑋 ∈ dom 𝑔)
97, 8bitri 274 . . 3 (𝑋 ∈ dom 𝐹 ↔ ∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}𝑋 ∈ dom 𝑔)
10 eqid 2738 . . . . . . . 8 {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
1110wfrlem1OLD 8110 . . . . . . 7 {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} = {𝑔 ∣ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤))))}
1211abeq2i 2874 . . . . . 6 (𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} ↔ ∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))))
13 predeq3 6195 . . . . . . . . . . . . 13 (𝑤 = 𝑋 → Pred(𝑅, 𝐴, 𝑤) = Pred(𝑅, 𝐴, 𝑋))
1413sseq1d 3948 . . . . . . . . . . . 12 (𝑤 = 𝑋 → (Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧 ↔ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧))
1514rspccv 3549 . . . . . . . . . . 11 (∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧 → (𝑋𝑧 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧))
1615adantl 481 . . . . . . . . . 10 ((𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) → (𝑋𝑧 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧))
17 fndm 6520 . . . . . . . . . . . . 13 (𝑔 Fn 𝑧 → dom 𝑔 = 𝑧)
1817eleq2d 2824 . . . . . . . . . . . 12 (𝑔 Fn 𝑧 → (𝑋 ∈ dom 𝑔𝑋𝑧))
1917sseq2d 3949 . . . . . . . . . . . 12 (𝑔 Fn 𝑧 → (Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔 ↔ Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧))
2018, 19imbi12d 344 . . . . . . . . . . 11 (𝑔 Fn 𝑧 → ((𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔) ↔ (𝑋𝑧 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧)))
2120adantr 480 . . . . . . . . . 10 ((𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) → ((𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔) ↔ (𝑋𝑧 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑧)))
2216, 21mpbird 256 . . . . . . . . 9 ((𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) → (𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔))
2322adantrl 712 . . . . . . . 8 ((𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧)) → (𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔))
24233adant3 1130 . . . . . . 7 ((𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))) → (𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔))
2524exlimiv 1934 . . . . . 6 (∃𝑧(𝑔 Fn 𝑧 ∧ (𝑧𝐴 ∧ ∀𝑤𝑧 Pred(𝑅, 𝐴, 𝑤) ⊆ 𝑧) ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔 ↾ Pred(𝑅, 𝐴, 𝑤)))) → (𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔))
2612, 25sylbi 216 . . . . 5 (𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} → (𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔))
2726reximia 3172 . . . 4 (∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}𝑋 ∈ dom 𝑔 → ∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔)
28 ssiun 4972 . . . 4 (∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔)
2927, 28syl 17 . . 3 (∃𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}𝑋 ∈ dom 𝑔 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔)
309, 29sylbi 216 . 2 (𝑋 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑋) ⊆ 𝑔 ∈ {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}dom 𝑔)
3130, 6sseqtrrdi 3968 1 (𝑋 ∈ dom 𝐹 → Pred(𝑅, 𝐴, 𝑋) ⊆ dom 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  wex 1783  wcel 2108  {cab 2715  wral 3063  wrex 3064  wss 3883   cuni 4836   ciun 4921  dom cdm 5580  cres 5582  Predcpred 6190   Fn wfn 6413  cfv 6418  wrecscwrecs 8098
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-fo 6424  df-fv 6426  df-ov 7258  df-2nd 7805  df-frecs 8068  df-wrecs 8099
This theorem is referenced by:  wfrlem10OLD  8120  wfrlem14OLD  8124  wfrlem15OLD  8125
  Copyright terms: Public domain W3C validator