Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elintima Structured version   Visualization version   GIF version

Theorem elintima 44638
Description: Element of intersection of images. (Contributed by RP, 13-Apr-2020.)
Assertion
Ref Expression
elintima (𝑦 ∈ ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)} ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑦,𝑎   𝐵,𝑏   𝑎,𝑏,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑦, 𝑎, 𝑏)   𝐵(𝑦, 𝑎)

Proof of Theorem elintima
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 vex 3455 . . 3 𝑦 ∈ V
21elint2 4914 . 2 (𝑦 ∈ ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)} ↔ ∀𝑧 ∈ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)}𝑦 ∈ 𝑧)
3 elequ2 2160 . . . 4 (𝑧 = 𝑥 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝑥))
43ralab2 3655 . . 3 (∀𝑧 ∈ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)}𝑦 ∈ 𝑧 ↔ ∀𝑥(∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) → 𝑦 ∈ 𝑥))
5 df-rex 3088 . . . . . . 7 (∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) ↔ ∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)))
65imbi1i 352 . . . . . 6 ((∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) → 𝑦 ∈ 𝑥) ↔ (∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥))
7 19.23v 1975 . . . . . 6 (∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥) ↔ (∃𝑎(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥))
8 simpr 490 . . . . . . . . . 10 ((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑥 = (𝑎 “ 𝐵))
98eleq2d 2847 . . . . . . . . 9 ((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ (𝑎 “ 𝐵)))
109pm5.74i 274 . . . . . . . 8 (((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ (𝑎 “ 𝐵)))
111elima 6061 . . . . . . . . . 10 (𝑦 ∈ (𝑎 “ 𝐵) ↔ ∃𝑏 ∈ 𝐵 𝑏𝑎𝑦)
12 df-br 5104 . . . . . . . . . . 11 (𝑏𝑎𝑦 ↔ ⟨𝑏, 𝑦⟩ ∈ 𝑎)
1312rexbii 3110 . . . . . . . . . 10 (∃𝑏 ∈ 𝐵 𝑏𝑎𝑦 ↔ ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
1411, 13bitri 278 . . . . . . . . 9 (𝑦 ∈ (𝑎 “ 𝐵) ↔ ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
1514imbi2i 339 . . . . . . . 8 (((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ (𝑎 “ 𝐵)) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
1610, 15bitri 278 . . . . . . 7 (((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
1716albii 1852 . . . . . 6 (∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → 𝑦 ∈ 𝑥) ↔ ∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
186, 7, 173bitr2i 302 . . . . 5 ((∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) → 𝑦 ∈ 𝑥) ↔ ∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
1918albii 1852 . . . 4 (∀𝑥(∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) → 𝑦 ∈ 𝑥) ↔ ∀𝑥∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
20 19.23v 1975 . . . . . . 7 (∀𝑥((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ (∃𝑥(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
21 vex 3455 . . . . . . . . . . 11 𝑎 ∈ V
2221imaex 7924 . . . . . . . . . 10 (𝑎 “ 𝐵) ∈ V
2322isseti 3469 . . . . . . . . 9 ∃𝑥 𝑥 = (𝑎 “ 𝐵)
24 19.42v 1986 . . . . . . . . 9 (∃𝑥(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) ↔ (𝑎 ∈ 𝐴 ∧ ∃𝑥 𝑥 = (𝑎 “ 𝐵)))
2523, 24mpbiran2 723 . . . . . . . 8 (∃𝑥(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) ↔ 𝑎 ∈ 𝐴)
2625imbi1i 352 . . . . . . 7 ((∃𝑥(𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ (𝑎 ∈ 𝐴 → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
2720, 26bitri 278 . . . . . 6 (∀𝑥((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ (𝑎 ∈ 𝐴 → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
2827albii 1852 . . . . 5 (∀𝑎∀𝑥((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ ∀𝑎(𝑎 ∈ 𝐴 → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
29 alcom 2196 . . . . 5 (∀𝑥∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ ∀𝑎∀𝑥((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
30 df-ral 3078 . . . . 5 (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎 ↔ ∀𝑎(𝑎 ∈ 𝐴 → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎))
3128, 29, 303bitr4i 306 . . . 4 (∀𝑥∀𝑎((𝑎 ∈ 𝐴 ∧ 𝑥 = (𝑎 “ 𝐵)) → ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎) ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
3219, 31bitri 278 . . 3 (∀𝑥(∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵) → 𝑦 ∈ 𝑥) ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
334, 32bitri 278 . 2 (∀𝑧 ∈ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)}𝑦 ∈ 𝑧 ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
342, 33bitri 278 1 (𝑦 ∈ ∩ {𝑥 ∣ ∃𝑎 ∈ 𝐴 𝑥 = (𝑎 “ 𝐵)} ↔ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 ⟨𝑏, 𝑦⟩ ∈ 𝑎)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  ⟨cop 4590  ∩ cint 4907   class class class wbr 5103   “ cima 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664
This theorem is used by:  intimass  44639  intimag  44641
  Copyright terms: Public domain W3C validator