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

Theorem preddowncl 6333
Description: A property of classes that are downward closed under predecessor. (Contributed by Scott Fenton, 13-Apr-2011.)
Assertion
Ref Expression
preddowncl ((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑋𝐵 → Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑅
Allowed substitution hint:   𝑋(𝑥)

Proof of Theorem preddowncl
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2821 . . . . 5 (𝑦 = 𝑋 → (𝑦𝐵𝑋𝐵))
2 predeq3 6304 . . . . . 6 (𝑦 = 𝑋 → Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐵, 𝑋))
3 predeq3 6304 . . . . . 6 (𝑦 = 𝑋 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑋))
42, 3eqeq12d 2748 . . . . 5 (𝑦 = 𝑋 → (Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐴, 𝑦) ↔ Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋)))
51, 4imbi12d 344 . . . 4 (𝑦 = 𝑋 → ((𝑦𝐵 → Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐴, 𝑦)) ↔ (𝑋𝐵 → Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋))))
65imbi2d 340 . . 3 (𝑦 = 𝑋 → (((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑦𝐵 → Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐴, 𝑦))) ↔ ((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑋𝐵 → Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋)))))
7 predpredss 6307 . . . . . 6 (𝐵𝐴 → Pred(𝑅, 𝐵, 𝑦) ⊆ Pred(𝑅, 𝐴, 𝑦))
87ad2antrr 724 . . . . 5 (((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) ∧ 𝑦𝐵) → Pred(𝑅, 𝐵, 𝑦) ⊆ Pred(𝑅, 𝐴, 𝑦))
9 predeq3 6304 . . . . . . . . . . . 12 (𝑥 = 𝑦 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑦))
109sseq1d 4013 . . . . . . . . . . 11 (𝑥 = 𝑦 → (Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵 ↔ Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵))
1110rspccva 3611 . . . . . . . . . 10 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵)
1211sseld 3981 . . . . . . . . 9 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → 𝑧𝐵))
13 vex 3478 . . . . . . . . . 10 𝑦 ∈ V
1413elpredim 6316 . . . . . . . . 9 (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → 𝑧𝑅𝑦)
1512, 14jca2 514 . . . . . . . 8 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → (𝑧𝐵𝑧𝑅𝑦)))
16 vex 3478 . . . . . . . . . . 11 𝑧 ∈ V
1716elpred 6317 . . . . . . . . . 10 (𝑦𝐵 → (𝑧 ∈ Pred(𝑅, 𝐵, 𝑦) ↔ (𝑧𝐵𝑧𝑅𝑦)))
1817imbi2d 340 . . . . . . . . 9 (𝑦𝐵 → ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → 𝑧 ∈ Pred(𝑅, 𝐵, 𝑦)) ↔ (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → (𝑧𝐵𝑧𝑅𝑦))))
1918adantl 482 . . . . . . . 8 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → ((𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → 𝑧 ∈ Pred(𝑅, 𝐵, 𝑦)) ↔ (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → (𝑧𝐵𝑧𝑅𝑦))))
2015, 19mpbird 256 . . . . . . 7 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → (𝑧 ∈ Pred(𝑅, 𝐴, 𝑦) → 𝑧 ∈ Pred(𝑅, 𝐵, 𝑦)))
2120ssrdv 3988 . . . . . 6 ((∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵𝑦𝐵) → Pred(𝑅, 𝐴, 𝑦) ⊆ Pred(𝑅, 𝐵, 𝑦))
2221adantll 712 . . . . 5 (((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) ∧ 𝑦𝐵) → Pred(𝑅, 𝐴, 𝑦) ⊆ Pred(𝑅, 𝐵, 𝑦))
238, 22eqssd 3999 . . . 4 (((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) ∧ 𝑦𝐵) → Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐴, 𝑦))
2423ex 413 . . 3 ((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑦𝐵 → Pred(𝑅, 𝐵, 𝑦) = Pred(𝑅, 𝐴, 𝑦)))
256, 24vtoclg 3556 . 2 (𝑋𝐵 → ((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑋𝐵 → Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋))))
2625pm2.43b 55 1 ((𝐵𝐴 ∧ ∀𝑥𝐵 Pred(𝑅, 𝐴, 𝑥) ⊆ 𝐵) → (𝑋𝐵 → Pred(𝑅, 𝐵, 𝑋) = Pred(𝑅, 𝐴, 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3061  wss 3948   class class class wbr 5148  Predcpred 6299
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682  df-cnv 5684  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300
This theorem is referenced by:  frrlem4  8276  wfrlem4OLD  8314
  Copyright terms: Public domain W3C validator