ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  findcard2d GIF version

Theorem findcard2d 6378
Description: Deduction version of findcard2 6376. If you also need 𝑦 ∈ Fin (which doesn't come for free due to ssfiexmid 6366), use findcard2sd 6379 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
StepHypRef Expression
1 ssid 2991 . 2 𝐴𝐴
2 findcard2d.a . . . 4 (𝜑𝐴 ∈ Fin)
32adantr 265 . . 3 ((𝜑𝐴𝐴) → 𝐴 ∈ Fin)
4 sseq1 2993 . . . . . 6 (𝑥 = ∅ → (𝑥𝐴 ↔ ∅ ⊆ 𝐴))
54anbi2d 445 . . . . 5 (𝑥 = ∅ → ((𝜑𝑥𝐴) ↔ (𝜑 ∧ ∅ ⊆ 𝐴)))
6 findcard2d.ch . . . . 5 (𝑥 = ∅ → (𝜓𝜒))
75, 6imbi12d 227 . . . 4 (𝑥 = ∅ → (((𝜑𝑥𝐴) → 𝜓) ↔ ((𝜑 ∧ ∅ ⊆ 𝐴) → 𝜒)))
8 sseq1 2993 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
98anbi2d 445 . . . . 5 (𝑥 = 𝑦 → ((𝜑𝑥𝐴) ↔ (𝜑𝑦𝐴)))
10 findcard2d.th . . . . 5 (𝑥 = 𝑦 → (𝜓𝜃))
119, 10imbi12d 227 . . . 4 (𝑥 = 𝑦 → (((𝜑𝑥𝐴) → 𝜓) ↔ ((𝜑𝑦𝐴) → 𝜃)))
12 sseq1 2993 . . . . . 6 (𝑥 = (𝑦 ∪ {𝑧}) → (𝑥𝐴 ↔ (𝑦 ∪ {𝑧}) ⊆ 𝐴))
1312anbi2d 445 . . . . 5 (𝑥 = (𝑦 ∪ {𝑧}) → ((𝜑𝑥𝐴) ↔ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)))
14 findcard2d.ta . . . . 5 (𝑥 = (𝑦 ∪ {𝑧}) → (𝜓𝜏))
1513, 14imbi12d 227 . . . 4 (𝑥 = (𝑦 ∪ {𝑧}) → (((𝜑𝑥𝐴) → 𝜓) ↔ ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → 𝜏)))
16 sseq1 2993 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐴𝐴𝐴))
1716anbi2d 445 . . . . 5 (𝑥 = 𝐴 → ((𝜑𝑥𝐴) ↔ (𝜑𝐴𝐴)))
18 findcard2d.et . . . . 5 (𝑥 = 𝐴 → (𝜓𝜂))
1917, 18imbi12d 227 . . . 4 (𝑥 = 𝐴 → (((𝜑𝑥𝐴) → 𝜓) ↔ ((𝜑𝐴𝐴) → 𝜂)))
20 findcard2d.z . . . . 5 (𝜑𝜒)
2120adantr 265 . . . 4 ((𝜑 ∧ ∅ ⊆ 𝐴) → 𝜒)
22 simprl 491 . . . . . . . 8 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝜑)
23 simprr 492 . . . . . . . . 9 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝑦 ∪ {𝑧}) ⊆ 𝐴)
2423unssad 3147 . . . . . . . 8 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑦𝐴)
2522, 24jca 294 . . . . . . 7 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝜑𝑦𝐴))
26 id 19 . . . . . . . . . . 11 ((𝑦 ∪ {𝑧}) ⊆ 𝐴 → (𝑦 ∪ {𝑧}) ⊆ 𝐴)
27 vsnid 3430 . . . . . . . . . . . 12 𝑧 ∈ {𝑧}
28 elun2 3138 . . . . . . . . . . . 12 (𝑧 ∈ {𝑧} → 𝑧 ∈ (𝑦 ∪ {𝑧}))
2927, 28mp1i 10 . . . . . . . . . . 11 ((𝑦 ∪ {𝑧}) ⊆ 𝐴𝑧 ∈ (𝑦 ∪ {𝑧}))
3026, 29sseldd 2973 . . . . . . . . . 10 ((𝑦 ∪ {𝑧}) ⊆ 𝐴𝑧𝐴)
3130ad2antll 468 . . . . . . . . 9 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑧𝐴)
32 simplr 490 . . . . . . . . 9 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → ¬ 𝑧𝑦)
3331, 32eldifd 2955 . . . . . . . 8 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → 𝑧 ∈ (𝐴𝑦))
34 findcard2d.i . . . . . . . 8 ((𝜑 ∧ (𝑦𝐴𝑧 ∈ (𝐴𝑦))) → (𝜃𝜏))
3522, 24, 33, 34syl12anc 1144 . . . . . . 7 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (𝜃𝜏))
3625, 35embantd 54 . . . . . 6 (((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) ∧ (𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴)) → (((𝜑𝑦𝐴) → 𝜃) → 𝜏))
3736ex 112 . . . . 5 ((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) → ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → (((𝜑𝑦𝐴) → 𝜃) → 𝜏)))
3837com23 76 . . . 4 ((𝑦 ∈ Fin ∧ ¬ 𝑧𝑦) → (((𝜑𝑦𝐴) → 𝜃) → ((𝜑 ∧ (𝑦 ∪ {𝑧}) ⊆ 𝐴) → 𝜏)))
397, 11, 15, 19, 21, 38findcard2s 6377 . . 3 (𝐴 ∈ Fin → ((𝜑𝐴𝐴) → 𝜂))
403, 39mpcom 36 . 2 ((𝜑𝐴𝐴) → 𝜂)
411, 40mpan2 409 1 (𝜑𝜂)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 101  wb 102   = wceq 1259  wcel 1409  cdif 2941  cun 2942  wss 2944  c0 3251  {csn 3402  Fincfn 6251
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3899  ax-sep 3902  ax-nul 3910  ax-pow 3954  ax-pr 3971  ax-un 4197  ax-setind 4289  ax-iinf 4338
This theorem depends on definitions:  df-bi 114  df-dc 754  df-3or 897  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-if 3359  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-int 3643  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-tr 3882  df-id 4057  df-iord 4130  df-on 4132  df-suc 4135  df-iom 4341  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-er 6136  df-en 6252  df-fin 6254
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator