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

Theorem indcardi 10032
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 8979 . . 3 (𝑇 ∈ dom card → 𝑇𝑇)
31, 2syl 17 . 2 (𝜑𝑇𝑇)
4 indcardi.a . . 3 (𝜑𝐴𝑉)
5 cardon 9935 . . . 4 (card‘𝑇) ∈ On
65a1i 11 . . 3 (𝜑 → (card‘𝑇) ∈ On)
7 simpl1 1188 . . . . 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 1188 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝜑)
1110, 1syl 17 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑇 ∈ dom card)
12 sdomdom 8972 . . . . . . . . . . . . . . . 16 (𝑆𝑅𝑆𝑅)
13 simpl3 1190 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅𝑇)
14 domtr 8999 . . . . . . . . . . . . . . . 16 ((𝑆𝑅𝑅𝑇) → 𝑆𝑇)
1512, 13, 14syl2an2 683 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑇)
16 numdom 10029 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑆𝑇) → 𝑆 ∈ dom card)
1711, 15, 16syl2anc 583 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆 ∈ dom card)
18 numdom 10029 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑅𝑇) → 𝑅 ∈ dom card)
1911, 13, 18syl2anc 583 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅 ∈ dom card)
20 cardsdom2 9979 . . . . . . . . . . . . . 14 ((𝑆 ∈ dom card ∧ 𝑅 ∈ dom card) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆𝑅))
2117, 19, 20syl2anc 583 . . . . . . . . . . . . 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 1911 . . . . . . . 8 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))
29283exp 1116 . . . . . . 7 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (𝑅𝑇 → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))))
3029com34 91 . . . . . 6 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → (𝑅𝑇 → ∀𝑦(𝑆𝑅𝜒)))))
31303imp1 1344 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → ∀𝑦(𝑆𝑅𝜒))
32 indcardi.c . . . . 5 ((𝜑𝑅𝑇 ∧ ∀𝑦(𝑆𝑅𝜒)) → 𝜓)
337, 8, 31, 32syl3anc 1368 . . . 4 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝜓)
3433ex 412 . . 3 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) → (𝑅𝑇𝜓))
35 indcardi.f . . . . 5 (𝑥 = 𝑦𝑅 = 𝑆)
3635breq1d 5148 . . . 4 (𝑥 = 𝑦 → (𝑅𝑇𝑆𝑇))
37 indcardi.d . . . 4 (𝑥 = 𝑦 → (𝜓𝜒))
3836, 37imbi12d 344 . . 3 (𝑥 = 𝑦 → ((𝑅𝑇𝜓) ↔ (𝑆𝑇𝜒)))
39 indcardi.g . . . . 5 (𝑥 = 𝐴𝑅 = 𝑇)
4039breq1d 5148 . . . 4 (𝑥 = 𝐴 → (𝑅𝑇𝑇𝑇))
41 indcardi.e . . . 4 (𝑥 = 𝐴 → (𝜓𝜃))
4240, 41imbi12d 344 . . 3 (𝑥 = 𝐴 → ((𝑅𝑇𝜓) ↔ (𝑇𝑇𝜃)))
4335fveq2d 6885 . . 3 (𝑥 = 𝑦 → (card‘𝑅) = (card‘𝑆))
4439fveq2d 6885 . . 3 (𝑥 = 𝐴 → (card‘𝑅) = (card‘𝑇))
454, 6, 34, 38, 42, 43, 44tfisi 7841 . 2 (𝜑 → (𝑇𝑇𝜃))
463, 45mpd 15 1 (𝜑𝜃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1084  wal 1531   = wceq 1533  wcel 2098  wss 3940   class class class wbr 5138  dom cdm 5666  Oncon0 6354  cfv 6533  cdom 8933  csdm 8934  cardccrd 9926
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-rmo 3368  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3959  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-se 5622  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6290  df-ord 6357  df-on 6358  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7357  df-ov 7404  df-2nd 7969  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-card 9930
This theorem is referenced by:  uzindi  13944  symggen  19380
  Copyright terms: Public domain W3C validator