Theorem brcogw 4891

Description: Ordered pair membership in a composition. (Contributed by Thierry Arnoux, 14-Jan-2018.)

Assertion

Ref	Expression
brcogw	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑋 ∈ 𝑍) ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → 𝐴(𝐶 ∘ 𝐷)𝐵)

Proof of Theorem brcogw

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1024	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑋 ∈ 𝑍) ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → 𝐴 ∈ 𝑉)
2		simpl2 1025	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑋 ∈ 𝑍) ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → 𝐵 ∈ 𝑊)
3		breq2 4087	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐴𝐷𝑥 ↔ 𝐴𝐷𝑋))
4		breq1 4086	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥𝐶𝐵 ↔ 𝑋𝐶𝐵))
5	3, 4	anbi12d 473	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵) ↔ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)))
6	5	spcegv 2891	. . . 4 ⊢ (𝑋 ∈ 𝑍 → ((𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵) → ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))
7	6	imp 124	. . 3 ⊢ ((𝑋 ∈ 𝑍 ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))
8	7	3ad2antl3 1185	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑋 ∈ 𝑍) ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵))
9		brcog 4889	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴(𝐶 ∘ 𝐷)𝐵 ↔ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)))
10	9	biimpar 297	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ ∃𝑥(𝐴𝐷𝑥 ∧ 𝑥𝐶𝐵)) → 𝐴(𝐶 ∘ 𝐷)𝐵)
11	1, 2, 8, 10	syl21anc 1270	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝑋 ∈ 𝑍) ∧ (𝐴𝐷𝑋 ∧ 𝑋𝐶𝐵)) → 𝐴(𝐶 ∘ 𝐷)𝐵)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002   = wceq 1395  ∃wex 1538   ∈ wcel 2200   class class class wbr 4083   ∘ ccom 4723

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-co 4728

This theorem is referenced by: (None)