Theorem findcard2d 6661

Description: Deduction version of findcard2 6659. If you also need 𝑦 ∈ Fin (which doesn't come for free due to ssfiexmid 6646), use findcard2sd 6662 instead. (Contributed by SO, 16-Jul-2018.)

Hypotheses

Ref	Expression
findcard2d.ch	⊢ (𝑥 = ∅ → (𝜓 ↔ 𝜒))
findcard2d.th	⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃))
findcard2d.ta	⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝜓 ↔ 𝜏))
findcard2d.et	⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜂))
findcard2d.z	⊢ (𝜑 → 𝜒)
findcard2d.i	⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (𝜃 → 𝜏))
findcard2d.a	⊢ (𝜑 → 𝐴 ∈ Fin)

Assertion

Ref	Expression
findcard2d	⊢ (𝜑 → 𝜂)

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝜓,𝑦,𝑧   𝜒,𝑥   𝜃,𝑥   𝜏,𝑥   𝜂,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦,𝑧)   𝜃(𝑦,𝑧)   𝜏(𝑦,𝑧)   𝜂(𝑦,𝑧)

Proof of Theorem findcard2d

Step	Hyp	Ref	Expression
1		ssid 3045	. 2 ⊢ 𝐴 ⊆ 𝐴
2		findcard2d.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin)
3	2	adantr 271	. . 3 ⊢ ((𝜑 ∧ 𝐴 ⊆ 𝐴) → 𝐴 ∈ Fin)
4		sseq1 3048	. . . . . 6 ⊢ (𝑥 = ∅ → (𝑥 ⊆ 𝐴 ↔ ∅ ⊆ 𝐴))
5	4	anbi2d 453	. . . . 5 ⊢ (𝑥 = ∅ → ((𝜑 ∧ 𝑥 ⊆ 𝐴) ↔ (𝜑 ∧ ∅ ⊆ 𝐴)))
6		findcard2d.ch	. . . . 5 ⊢ (𝑥 = ∅ → (𝜓 ↔ 𝜒))
7	5, 6	imbi12d 233	. . . 4 ⊢ (𝑥 = ∅ → (((𝜑 ∧ 𝑥 ⊆ 𝐴) → 𝜓) ↔ ((𝜑 ∧ ∅ ⊆ 𝐴) → 𝜒)))
8		sseq1 3048	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴))
9	8	anbi2d 453	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝜑 ∧ 𝑥 ⊆ 𝐴) ↔ (𝜑 ∧ 𝑦 ⊆ 𝐴)))
10		findcard2d.th	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃))
11	9, 10	imbi12d 233	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝜑 ∧ 𝑥 ⊆ 𝐴) → 𝜓) ↔ ((𝜑 ∧ 𝑦 ⊆ 𝐴) → 𝜃)))
12		sseq1 3048	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥 ⊆ 𝐴 ↔ (𝑦 ∪ {𝑧}) ⊆ 𝐴))
13	12	anbi2d 453	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝜑 ∧ 𝑥 ⊆ 𝐴) ↔ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)))
14		findcard2d.ta	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝜓 ↔ 𝜏))
15	13, 14	imbi12d 233	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (((𝜑 ∧ 𝑥 ⊆ 𝐴) → 𝜓) ↔ ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → 𝜏)))
16		sseq1 3048	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴))
17	16	anbi2d 453	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝜑 ∧ 𝑥 ⊆ 𝐴) ↔ (𝜑 ∧ 𝐴 ⊆ 𝐴)))
18		findcard2d.et	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜂))
19	17, 18	imbi12d 233	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝜑 ∧ 𝑥 ⊆ 𝐴) → 𝜓) ↔ ((𝜑 ∧ 𝐴 ⊆ 𝐴) → 𝜂)))
20		findcard2d.z	. . . . 5 ⊢ (𝜑 → 𝜒)
21	20	adantr 271	. . . 4 ⊢ ((𝜑 ∧ ∅ ⊆ 𝐴) → 𝜒)
22		simprl 499	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝜑)
23		simprr 500	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝑦 ∪ {𝑧}) ⊆ 𝐴)
24	23	unssad 3178	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑦 ⊆ 𝐴)
25	22, 24	jca 301	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝜑 ∧ 𝑦 ⊆ 𝐴))
26		id 19	. . . . . . . . . . 11 ⊢ ((𝑦 ∪ {𝑧}) ⊆ 𝐴 → (𝑦 ∪ {𝑧}) ⊆ 𝐴)
27		vsnid 3480	. . . . . . . . . . . 12 ⊢ 𝑧 ∈ {𝑧}
28		elun2 3169	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ {𝑧} → 𝑧 ∈ (𝑦 ∪ {𝑧}))
29	27, 28	mp1i 10	. . . . . . . . . . 11 ⊢ ((𝑦 ∪ {𝑧}) ⊆ 𝐴 → 𝑧 ∈ (𝑦 ∪ {𝑧}))
30	26, 29	sseldd 3027	. . . . . . . . . 10 ⊢ ((𝑦 ∪ {𝑧}) ⊆ 𝐴 → 𝑧 ∈ 𝐴)
31	30	ad2antll 476	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑧 ∈ 𝐴)
32		simplr 498	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → ¬ 𝑧 ∈ 𝑦)
33	31, 32	eldifd 3010	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑧 ∈ (𝐴 ∖ 𝑦))
34		findcard2d.i	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝐴 ∧ 𝑧 ∈ (𝐴 ∖ 𝑦))) → (𝜃 → 𝜏))
35	22, 24, 33, 34	syl12anc 1173	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝜃 → 𝜏))
36	25, 35	embantd 56	. . . . . 6 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (((𝜑 ∧ 𝑦 ⊆ 𝐴) → 𝜃) → 𝜏))
37	36	ex 114	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (((𝜑 ∧ 𝑦 ⊆ 𝐴) → 𝜃) → 𝜏)))
38	37	com23 78	. . . 4 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (((𝜑 ∧ 𝑦 ⊆ 𝐴) → 𝜃) → ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → 𝜏)))
39	7, 11, 15, 19, 21, 38	findcard2s 6660	. . 3 ⊢ (𝐴 ∈ Fin → ((𝜑 ∧ 𝐴 ⊆ 𝐴) → 𝜂))
40	3, 39	mpcom 36	. 2 ⊢ ((𝜑 ∧ 𝐴 ⊆ 𝐴) → 𝜂)
41	1, 40	mpan2 417	1 ⊢ (𝜑 → 𝜂)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1290   ∈ wcel 1439   ∖ cdif 2997   ∪ cun 2998   ⊆ wss 3000  ∅c0 3287  {csn 3450  Fincfn 6511

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-nul 3971  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-iinf 4416

This theorem depends on definitions:  df-bi 116  df-dc 782  df-3or 926  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-if 3398  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-int 3695  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-tr 3943  df-id 4129  df-iord 4202  df-on 4204  df-suc 4207  df-iom 4419  df-xp 4457  df-rel 4458  df-cnv 4459  df-co 4460  df-dm 4461  df-rn 4462  df-res 4463  df-ima 4464  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-er 6306  df-en 6512  df-fin 6514

This theorem is referenced by:  iunfidisj  6709