Theorem indcardi 9469

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 8546	. . 3 ⊢ (𝑇 ∈ dom card → 𝑇 ≼ 𝑇)
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑇 ≼ 𝑇)
4		indcardi.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		cardon 9375	. . . 4 ⊢ (card‘𝑇) ∈ On
6	5	a1i 11	. . 3 ⊢ (𝜑 → (card‘𝑇) ∈ On)
7		simpl1 1187	. . . . 5 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → 𝜑)
8		simpr 487	. . . . 5 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → 𝑅 ≼ 𝑇)
9		simpr 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑆 ≺ 𝑅)
10		simpl1 1187	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝜑)
11	10, 1	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑇 ∈ dom card)
12		sdomdom 8539	. . . . . . . . . . . . . . . 16 ⊢ (𝑆 ≺ 𝑅 → 𝑆 ≼ 𝑅)
13		simpl3 1189	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑅 ≼ 𝑇)
14		domtr 8564	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ≼ 𝑅 ∧ 𝑅 ≼ 𝑇) → 𝑆 ≼ 𝑇)
15	12, 13, 14	syl2an2 684	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑆 ≼ 𝑇)
16		numdom 9466	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ dom card ∧ 𝑆 ≼ 𝑇) → 𝑆 ∈ dom card)
17	11, 15, 16	syl2anc 586	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑆 ∈ dom card)
18		numdom 9466	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ dom card ∧ 𝑅 ≼ 𝑇) → 𝑅 ∈ dom card)
19	11, 13, 18	syl2anc 586	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → 𝑅 ∈ dom card)
20		cardsdom2 9419	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ dom card ∧ 𝑅 ∈ dom card) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆 ≺ 𝑅))
21	17, 19, 20	syl2anc 586	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) ∧ 𝑆 ≺ 𝑅) → ((card‘𝑆) ∈ (card‘𝑅) ↔ 𝑆 ≺ 𝑅))
22	9, 21	mpbird 259	. . . . . . . . . . . 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 415	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (𝑆 ≺ 𝑅 → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → 𝜒)))
27	26	com23 86	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → (𝑆 ≺ 𝑅 → 𝜒)))
28	27	alimdv 1917	. . . . . . . 8 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ 𝑅 ≼ 𝑇) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))
29	28	3exp 1115	. . . . . . 7 ⊢ (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (𝑅 ≼ 𝑇 → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))))
30	29	com34 91	. . . . . 6 ⊢ (𝜑 → (((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) → (∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒)) → (𝑅 ≼ 𝑇 → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)))))
31	30	3imp1 1343	. . . . 5 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → ∀𝑦(𝑆 ≺ 𝑅 → 𝜒))
32		indcardi.c	. . . . 5 ⊢ ((𝜑 ∧ 𝑅 ≼ 𝑇 ∧ ∀𝑦(𝑆 ≺ 𝑅 → 𝜒)) → 𝜓)
33	7, 8, 31, 32	syl3anc 1367	. . . 4 ⊢ (((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) ∧ 𝑅 ≼ 𝑇) → 𝜓)
34	33	ex 415	. . 3 ⊢ ((𝜑 ∧ ((card‘𝑅) ∈ On ∧ (card‘𝑅) ⊆ (card‘𝑇)) ∧ ∀𝑦((card‘𝑆) ∈ (card‘𝑅) → (𝑆 ≼ 𝑇 → 𝜒))) → (𝑅 ≼ 𝑇 → 𝜓))
35		indcardi.f	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝑅 = 𝑆)
36	35	breq1d 5078	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑅 ≼ 𝑇 ↔ 𝑆 ≼ 𝑇))
37		indcardi.d	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜒))
38	36, 37	imbi12d 347	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑅 ≼ 𝑇 → 𝜓) ↔ (𝑆 ≼ 𝑇 → 𝜒)))
39		indcardi.g	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝑅 = 𝑇)
40	39	breq1d 5078	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑅 ≼ 𝑇 ↔ 𝑇 ≼ 𝑇))
41		indcardi.e	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜃))
42	40, 41	imbi12d 347	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑅 ≼ 𝑇 → 𝜓) ↔ (𝑇 ≼ 𝑇 → 𝜃)))
43	35	fveq2d 6676	. . 3 ⊢ (𝑥 = 𝑦 → (card‘𝑅) = (card‘𝑆))
44	39	fveq2d 6676	. . 3 ⊢ (𝑥 = 𝐴 → (card‘𝑅) = (card‘𝑇))
45	4, 6, 34, 38, 42, 43, 44	tfisi 7575	. 2 ⊢ (𝜑 → (𝑇 ≼ 𝑇 → 𝜃))
46	3, 45	mpd 15	1 ⊢ (𝜑 → 𝜃)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083  ∀wal 1535   = wceq 1537   ∈ wcel 2114   ⊆ wss 3938   class class class wbr 5068  dom cdm 5557  Oncon0 6193  ‘cfv 6357   ≼ cdom 8509   ≺ csdm 8510  cardccrd 9366

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-wrecs 7949  df-recs 8010  df-er 8291  df-en 8512  df-dom 8513  df-sdom 8514  df-card 9370

This theorem is referenced by:  uzindi  13353  symggen  18600