Theorem indcardi 9965

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

Step	Hyp	Ref	Expression
1		indcardi.b	. . 3 ⊢ (𝜑 → 𝑇 ∈ dom card)
2		domrefg 8938	. . 3 ⊢ (𝑇 ∈ dom card → 𝑇 ≼ 𝑇)
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑇 ≼ 𝑇)
4		indcardi.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		cardon 9870	. . . 4 ⊢ (card‘𝑇) ∈ On
6	5	a1i 11	. . 3 ⊢ (𝜑 → (card‘𝑇) ∈ On)
7		simpl1 1193	. . . . 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 1193	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝜑)
11	10, 1	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑇 ∈ dom card)
12		sdomdom 8931	. . . . . . . . . . . . . . . 16 ⊢ (𝑆 ≺ 𝑅 → 𝑆 ≼ 𝑅)
13		simpl3 1195	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑅 ≼ 𝑇)
14		domtr 8958	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ≼ 𝑅 ∧ 𝑅 ≼ 𝑇) → 𝑆 ≼ 𝑇)
15	12, 13, 14	syl2an2 687	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑆 ≼ 𝑇)
16		numdom 9962	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ dom card ∧ 𝑆 ≼ 𝑇) → 𝑆 ∈ dom card)
17	11, 15, 16	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑆 ∈ dom card)
18		numdom 9962	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ dom card ∧ 𝑅 ≼ 𝑇) → 𝑅 ∈ dom card)
19	11, 13, 18	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑅 ∈ dom card)
20		cardsdom2 9914	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ dom card ∧ 𝑅 ∈ dom card) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆 ≺ 𝑅))
21	17, 19, 20	syl2anc 585	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆 ≺ 𝑅))
22	9, 21	mpbird 257	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → (card‘𝑆) ∈ (card‘𝑅))
23		id 22	. . . . . . . . . . . . 13 ⊢ (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → ((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)))
24	23	com3l 89	. . . . . . . . . . . 12 ⊢ ((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → 𝜒)))
25	22, 15, 24	sylc 65	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → 𝜒))
26	25	ex 412	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (𝑆 ≺ 𝑅 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → 𝜒)))
27	26	com23 86	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → (𝑆 ≺ 𝑅 → 𝜒)))
28	27	alimdv 1918	. . . . . . . 8 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))
29	28	3exp 1120	. . . . . . 7 ⊢ (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (𝑅 ≼ 𝑇 → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))))
30	29	com34 91	. . . . . 6 ⊢ (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → (𝑅 ≼ 𝑇 → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))))
31	30	3imp1 1349	. . . . 5 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒))
32		indcardi.c	. . . . 5 ⊢ ((𝜑 ∧ 𝑅 ≼ 𝑇 ∧ ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)) → 𝜓)
33	7, 8, 31, 32	syl3anc 1374	. . . 4 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → 𝜓)
34	33	ex 412	. . 3 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) → (𝑅 ≼ 𝑇 → 𝜓))
35		indcardi.f	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝑅 = 𝑆)
36	35	breq1d 5110	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑅 ≼ 𝑇 ↔ 𝑆 ≼ 𝑇))
37		indcardi.d	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜒))
38	36, 37	imbi12d 344	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑅 ≼ 𝑇 → 𝜓) ↔ (𝑆 ≼ 𝑇 → 𝜒)))
39		indcardi.g	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝑅 = 𝑇)
40	39	breq1d 5110	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑅 ≼ 𝑇 ↔ 𝑇 ≼ 𝑇))
41		indcardi.e	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜃))
42	40, 41	imbi12d 344	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑅 ≼ 𝑇 → 𝜓) ↔ (𝑇 ≼ 𝑇 → 𝜃)))
43	35	fveq2d 6848	. . 3 ⊢ (𝑥 = 𝑦 → (card‘𝑅) = (card‘𝑆))
44	39	fveq2d 6848	. . 3 ⊢ (𝑥 = 𝐴 → (card‘𝑅) = (card‘𝑇))
45	4, 6, 34, 38, 42, 43, 44	tfisi 7813	. 2 ⊢ (𝜑 → (𝑇 ≼ 𝑇 → 𝜃))
46	3, 45	mpd 15	1 ⊢ (𝜑 → 𝜃)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542   ∈ wcel 2114   ⊆ wss 3903   class class class wbr 5100  dom cdm 5634  Oncon0 6327  ‘cfv 6502   ≼ cdom 8895   ≺ csdm 8896  cardccrd 9861

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-se 5588  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-isom 6511  df-riota 7327  df-ov 7373  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-er 8647  df-en 8898  df-dom 8899  df-sdom 8900  df-card 9865

This theorem is referenced by:  uzindi  13919  symggen  19416