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

Theorem indcardi 9143
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 8223 . . 3 (𝑇 ∈ dom card → 𝑇𝑇)
31, 2syl 17 . 2 (𝜑𝑇𝑇)
4 indcardi.a . . 3 (𝜑𝐴𝑉)
5 cardon 9049 . . . 4 (card‘𝑇) ∈ On
65a1i 11 . . 3 (𝜑 → (card‘𝑇) ∈ On)
7 simpl1 1235 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝜑)
8 simpr 473 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝑅𝑇)
9 simpr 473 . . . . . . . . . . . . 13 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑅)
10 simpl1 1235 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝜑)
1110, 1syl 17 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑇 ∈ dom card)
12 sdomdom 8216 . . . . . . . . . . . . . . . . 17 (𝑆𝑅𝑆𝑅)
1312adantl 469 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑅)
14 simpl3 1239 . . . . . . . . . . . . . . . 16 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅𝑇)
15 domtr 8241 . . . . . . . . . . . . . . . 16 ((𝑆𝑅𝑅𝑇) → 𝑆𝑇)
1613, 14, 15syl2anc 575 . . . . . . . . . . . . . . 15 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆𝑇)
17 numdom 9140 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑆𝑇) → 𝑆 ∈ dom card)
1811, 16, 17syl2anc 575 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑆 ∈ dom card)
19 numdom 9140 . . . . . . . . . . . . . . 15 ((𝑇 ∈ dom card ∧ 𝑅𝑇) → 𝑅 ∈ dom card)
2011, 14, 19syl2anc 575 . . . . . . . . . . . . . 14 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → 𝑅 ∈ dom card)
21 cardsdom2 9093 . . . . . . . . . . . . . 14 ((𝑆 ∈ dom card ∧ 𝑅 ∈ dom card) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆𝑅))
2218, 20, 21syl2anc 575 . . . . . . . . . . . . 13 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆𝑅))
239, 22mpbird 248 . . . . . . . . . . . 12 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → (card‘𝑆) ∈ (card‘𝑅))
24 id 22 . . . . . . . . . . . . 13 (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)))
2524com3l 89 . . . . . . . . . . . 12 ((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒)))
2623, 16, 25sylc 65 . . . . . . . . . . 11 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) ∧ 𝑆𝑅) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒))
2726ex 399 . . . . . . . . . 10 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (𝑆𝑅 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → 𝜒)))
2827com23 86 . . . . . . . . 9 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → (𝑆𝑅𝜒)))
2928alimdv 2007 . . . . . . . 8 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅𝑇) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))
30293exp 1141 . . . . . . 7 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (𝑅𝑇 → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → ∀𝑦(𝑆𝑅𝜒)))))
3130com34 91 . . . . . 6 (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒)) → (𝑅𝑇 → ∀𝑦(𝑆𝑅𝜒)))))
32313imp1 1449 . . . . 5 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → ∀𝑦(𝑆𝑅𝜒))
33 indcardi.c . . . . 5 ((𝜑𝑅𝑇 ∧ ∀𝑦(𝑆𝑅𝜒)) → 𝜓)
347, 8, 32, 33syl3anc 1483 . . . 4 (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) ∧ 𝑅𝑇) → 𝜓)
3534ex 399 . . 3 ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆𝑇𝜒))) → (𝑅𝑇𝜓))
36 indcardi.f . . . . 5 (𝑥 = 𝑦𝑅 = 𝑆)
3736breq1d 4854 . . . 4 (𝑥 = 𝑦 → (𝑅𝑇𝑆𝑇))
38 indcardi.d . . . 4 (𝑥 = 𝑦 → (𝜓𝜒))
3937, 38imbi12d 335 . . 3 (𝑥 = 𝑦 → ((𝑅𝑇𝜓) ↔ (𝑆𝑇𝜒)))
40 indcardi.g . . . . 5 (𝑥 = 𝐴𝑅 = 𝑇)
4140breq1d 4854 . . . 4 (𝑥 = 𝐴 → (𝑅𝑇𝑇𝑇))
42 indcardi.e . . . 4 (𝑥 = 𝐴 → (𝜓𝜃))
4341, 42imbi12d 335 . . 3 (𝑥 = 𝐴 → ((𝑅𝑇𝜓) ↔ (𝑇𝑇𝜃)))
4436fveq2d 6408 . . 3 (𝑥 = 𝑦 → (card‘𝑅) = (card‘𝑆))
4540fveq2d 6408 . . 3 (𝑥 = 𝐴 → (card‘𝑅) = (card‘𝑇))
464, 6, 35, 39, 43, 44, 45tfisi 7284 . 2 (𝜑 → (𝑇𝑇𝜃))
473, 46mpd 15 1 (𝜑𝜃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  w3a 1100  wal 1635   = wceq 1637  wcel 2156  wss 3769   class class class wbr 4844  dom cdm 5311  Oncon0 5936  cfv 6097  cdom 8186  csdm 8187  cardccrd 9040
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096  ax-un 7175
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3or 1101  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-ral 3101  df-rex 3102  df-reu 3103  df-rmo 3104  df-rab 3105  df-v 3393  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-pss 3785  df-nul 4117  df-if 4280  df-pw 4353  df-sn 4371  df-pr 4373  df-tp 4375  df-op 4377  df-uni 4631  df-int 4670  df-iun 4714  df-br 4845  df-opab 4907  df-mpt 4924  df-tr 4947  df-id 5219  df-eprel 5224  df-po 5232  df-so 5233  df-fr 5270  df-se 5271  df-we 5272  df-xp 5317  df-rel 5318  df-cnv 5319  df-co 5320  df-dm 5321  df-rn 5322  df-res 5323  df-ima 5324  df-pred 5893  df-ord 5939  df-on 5940  df-suc 5942  df-iota 6060  df-fun 6099  df-fn 6100  df-f 6101  df-f1 6102  df-fo 6103  df-f1o 6104  df-fv 6105  df-isom 6106  df-riota 6831  df-wrecs 7638  df-recs 7700  df-er 7975  df-en 8189  df-dom 8190  df-sdom 8191  df-card 9044
This theorem is referenced by:  uzindi  13001  symggen  18087
  Copyright terms: Public domain W3C validator