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

Theorem indcardi 9949
Description: Indirect strong induction on the cardinality of a finite or numerable set. (Contributed by Stefan O'Rear, 24-Aug-2015.)
Hypotheses
Ref Expression
indcardi.a (𝜑𝐴𝑉)
indcardi.b (𝜑𝑇 ∈ dom card)
indcardi.c ((𝜑𝑅𝑇 ∧ ∀𝑦(𝑆𝑅𝜒)) → 𝜓)
indcardi.d (𝑥 = 𝑦 → (𝜓𝜒))
indcardi.e (𝑥 = 𝐴 → (𝜓𝜃))
indcardi.f (𝑥 = 𝑦𝑅 = 𝑆)
indcardi.g (𝑥 = 𝐴𝑅 = 𝑇)
Assertion
Ref Expression
indcardi (𝜑𝜃)
Distinct variable groups:   𝑥,𝑦,𝑇   𝑥,𝐴   𝑥,𝑆   𝜒,𝑥   𝜑,𝑥,𝑦   𝜃,𝑥   𝑦,𝑅   𝜓,𝑦
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝜃(𝑦)   𝐴(𝑦)   𝑅(𝑥)   𝑆(𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem indcardi
StepHypRef Expression
1 indcardi.b . . 3 (𝜑𝑇 ∈ dom card)
2 domrefg 8922 . . 3 (𝑇 ∈ dom card → 𝑇𝑇)
31, 2syl 17 . 2 (𝜑𝑇𝑇)
4 indcardi.a . . 3 (𝜑𝐴𝑉)
5 cardon 9854 . . . 4 (card‘𝑇) ∈ On
65a1i 11 . . 3 (𝜑 → (card‘𝑇) ∈ On)
7 simpl1 1192 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝜑)
8 simpr 484 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝑅𝑇)
9 simpr 484 . . . . . . . . . . . . 13 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑅)
10 simpl1 1192 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝜑)
1110, 1syl 17 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑇 ∈ dom card)
12 sdomdom 8915 . . . . . . . . . . . . . . . 16 (𝑆𝑅𝑆𝑅)
13 simpl3 1194 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅𝑇)
14 domtr 8942 . . . . . . . . . . . . . . . 16 ((𝑆𝑅𝑅𝑇) → 𝑆𝑇)
1512, 13, 14syl2an2 686 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑇)
16 numdom 9946 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑆𝑇) → 𝑆 ∈ dom card)
1711, 15, 16syl2anc 584 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆 ∈ dom card)
18 numdom 9946 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑅𝑇) → 𝑅 ∈ dom card)
1911, 13, 18syl2anc 584 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅 ∈ dom card)
20 cardsdom2 9898 . . . . . . . . . . . . . 14 ((𝑆 ∈ dom card ∧ 𝑅 ∈ dom card) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆𝑅))
2117, 19, 20syl2anc 584 . . . . . . . . . . . . 13 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆𝑅))
229, 21mpbird 257 . . . . . . . . . . . 12 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → (card‘𝑆) ∈ (card‘𝑅))
23 id 22 . . . . . . . . . . . . 13 (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)))
2423com3l 89 . . . . . . . . . . . 12 ((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒)))
2522, 15, 24sylc 65 . . . . . . . . . . 11 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒))
2625ex 412 . . . . . . . . . 10 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (𝑆𝑅 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒)))
2726com23 86 . . . . . . . . 9 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → (𝑆𝑅𝜒)))
2827alimdv 1917 . . . . . . . 8 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))
29283exp 1119 . . . . . . 7 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (𝑅𝑇 → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))))
3029com34 91 . . . . . 6 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → (𝑅𝑇 → ∀𝑦(𝑆𝑅𝜒)))))
31303imp1 1348 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → ∀𝑦(𝑆𝑅𝜒))
32 indcardi.c . . . . 5 ((𝜑𝑅𝑇 ∧ ∀𝑦(𝑆𝑅𝜒)) → 𝜓)
337, 8, 31, 32syl3anc 1373 . . . 4 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝜓)
3433ex 412 . . 3 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) → (𝑅𝑇𝜓))
35 indcardi.f . . . . 5 (𝑥 = 𝑦𝑅 = 𝑆)
3635breq1d 5106 . . . 4 (𝑥 = 𝑦 → (𝑅𝑇𝑆𝑇))
37 indcardi.d . . . 4 (𝑥 = 𝑦 → (𝜓𝜒))
3836, 37imbi12d 344 . . 3 (𝑥 = 𝑦 → ((𝑅𝑇𝜓) ↔ (𝑆𝑇𝜒)))
39 indcardi.g . . . . 5 (𝑥 = 𝐴𝑅 = 𝑇)
4039breq1d 5106 . . . 4 (𝑥 = 𝐴 → (𝑅𝑇𝑇𝑇))
41 indcardi.e . . . 4 (𝑥 = 𝐴 → (𝜓𝜃))
4240, 41imbi12d 344 . . 3 (𝑥 = 𝐴 → ((𝑅𝑇𝜓) ↔ (𝑇𝑇𝜃)))
4335fveq2d 6836 . . 3 (𝑥 = 𝑦 → (card‘𝑅) = (card‘𝑆))
4439fveq2d 6836 . . 3 (𝑥 = 𝐴 → (card‘𝑅) = (card‘𝑇))
454, 6, 34, 38, 42, 43, 44tfisi 7799 . 2 (𝜑 → (𝑇𝑇𝜃))
463, 45mpd 15 1 (𝜑𝜃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086  wal 1539   = wceq 1541  wcel 2113  wss 3899   class class class wbr 5096  dom cdm 5622  Oncon0 6315  cfv 6490  cdom 8879  csdm 8880  cardccrd 9845
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-isom 6499  df-riota 7313  df-ov 7359  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-er 8633  df-en 8882  df-dom 8883  df-sdom 8884  df-card 9849
This theorem is referenced by:  uzindi  13903  symggen  19397
  Copyright terms: Public domain W3C validator