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

Theorem cardpred 35543
Description: The cardinality function preserves predecessors. (Contributed by BTernaryTau, 18-Jul-2024.)
Assertion
Ref Expression
cardpred ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → Pred( E , (card “ 𝐴), (card‘𝐵)) = (card “ Pred( ≺ , 𝐴, 𝐵)))

Proof of Theorem cardpred
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cardf2 9945 . . 3 card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On
2 ffun 6712 . . . 4 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → Fun card)
32funfnd 6571 . . 3 (card:{𝑥 ∣ ∃𝑦 ∈ On 𝑦𝑥}⟶On → card Fn dom card)
41, 3mp1i 14 . 2 ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → card Fn dom card)
5 fvex 6898 . . . . . 6 (card‘𝑦) ∈ V
65epeli 5565 . . . . 5 ((card‘𝑥) E (card‘𝑦) ↔ (card‘𝑥) ∈ (card‘𝑦))
7 cardsdom2 9990 . . . . 5 ((𝑥 ∈ dom card ∧ 𝑦 ∈ dom card) → ((card‘𝑥) ∈ (card‘𝑦) ↔ 𝑥𝑦))
86, 7bitr2id 287 . . . 4 ((𝑥 ∈ dom card ∧ 𝑦 ∈ dom card) → (𝑥𝑦 ↔ (card‘𝑥) E (card‘𝑦)))
98rgen2 3207 . . 3 𝑥 ∈ dom card∀𝑦 ∈ dom card(𝑥𝑦 ↔ (card‘𝑥) E (card‘𝑦))
109a1i 11 . 2 ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → ∀𝑥 ∈ dom card∀𝑦 ∈ dom card(𝑥𝑦 ↔ (card‘𝑥) E (card‘𝑦)))
11 simpl 488 . 2 ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → 𝐴 ⊆ dom card)
12 simpr 490 . 2 ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → 𝐵 ∈ dom card)
134, 10, 11, 12fnrelpredd 35542 1 ((𝐴 ⊆ dom card ∧ 𝐵 ∈ dom card) → Pred( E , (card “ 𝐴), (card‘𝐵)) = (card “ Pred( ≺ , 𝐴, 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  {cab 2743  wral 3081  wrex 3091  wss 3906   class class class wbr 5111   E cep 5562  dom cdm 5663  cima 5666  Predcpred 6305  Oncon0 6364   Fn wfn 6535  wf 6536  cfv 6540  cen 8946  csdm 8948  cardccrd 9937
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-card 9941
This theorem is used by:  nummin  35544
  Copyright terms: Public domain W3C validator