Theorem f1omvdco2 19357

Description: If exactly one of two permutations is limited to a set of points, then the composition will not be. (Contributed by Stefan O'Rear, 23-Aug-2015.)

Assertion

Ref	Expression
f1omvdco2	⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴 ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ⊻ dom (𝐺 ∖ I ) ⊆ 𝑋)) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)

Proof of Theorem f1omvdco2

Step	Hyp	Ref	Expression
1		excxor 1513	. . 3 ⊢ ((dom (𝐹 ∖ I ) ⊆ 𝑋 ⊻ dom (𝐺 ∖ I ) ⊆ 𝑋) ↔ ((dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ ¬ dom (𝐺 ∖ I ) ⊆ 𝑋) ∨ (¬ dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom (𝐺 ∖ I ) ⊆ 𝑋)))
2		coass 6263	. . . . . . . . . . . 12 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺))
3		f1ococnv1 6861	. . . . . . . . . . . . . 14 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
4	3	coeq1d 5860	. . . . . . . . . . . . 13 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺))
5		f1of 6832	. . . . . . . . . . . . . 14 ⊢ (𝐺:𝐴–1-1-onto→𝐴 → 𝐺:𝐴⟶𝐴)
6		fcoi2 6765	. . . . . . . . . . . . . 14 ⊢ (𝐺:𝐴⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
7	5, 6	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐺:𝐴–1-1-onto→𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
8	4, 7	sylan9eq 2790	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺)
9	2, 8	eqtr3id 2784	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺)
10	9	difeq1d 4120	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((◡𝐹 ∘ (𝐹 ∘ 𝐺)) ∖ I ) = (𝐺 ∖ I ))
11	10	dmeqd 5904	. . . . . . . . 9 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → dom ((◡𝐹 ∘ (𝐹 ∘ 𝐺)) ∖ I ) = dom (𝐺 ∖ I ))
12	11	adantr 479	. . . . . . . 8 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom ((◡𝐹 ∘ (𝐹 ∘ 𝐺)) ∖ I ) = dom (𝐺 ∖ I ))
13		mvdco 19354	. . . . . . . . 9 ⊢ dom ((◡𝐹 ∘ (𝐹 ∘ 𝐺)) ∖ I ) ⊆ (dom (◡𝐹 ∖ I ) ∪ dom ((𝐹 ∘ 𝐺) ∖ I ))
14		f1omvdcnv 19353	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → dom (◡𝐹 ∖ I ) = dom (𝐹 ∖ I ))
15	14	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (◡𝐹 ∖ I ) = dom (𝐹 ∖ I ))
16		simprl 767	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (𝐹 ∖ I ) ⊆ 𝑋)
17	15, 16	eqsstrd 4019	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (◡𝐹 ∖ I ) ⊆ 𝑋)
18		simprr 769	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)
19	17, 18	unssd 4185	. . . . . . . . 9 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → (dom (◡𝐹 ∖ I ) ∪ dom ((𝐹 ∘ 𝐺) ∖ I )) ⊆ 𝑋)
20	13, 19	sstrid 3992	. . . . . . . 8 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom ((◡𝐹 ∘ (𝐹 ∘ 𝐺)) ∖ I ) ⊆ 𝑋)
21	12, 20	eqsstrrd 4020	. . . . . . 7 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (𝐺 ∖ I ) ⊆ 𝑋)
22	21	expr 455	. . . . . 6 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ dom (𝐹 ∖ I ) ⊆ 𝑋) → (dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋 → dom (𝐺 ∖ I ) ⊆ 𝑋))
23	22	con3d 152	. . . . 5 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ dom (𝐹 ∖ I ) ⊆ 𝑋) → (¬ dom (𝐺 ∖ I ) ⊆ 𝑋 → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
24	23	expimpd 452	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ ¬ dom (𝐺 ∖ I ) ⊆ 𝑋) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
25		coass 6263	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = (𝐹 ∘ (𝐺 ∘ ◡𝐺))
26		f1ococnv2 6859	. . . . . . . . . . . . . . 15 ⊢ (𝐺:𝐴–1-1-onto→𝐴 → (𝐺 ∘ ◡𝐺) = ( I ↾ 𝐴))
27	26	coeq2d 5861	. . . . . . . . . . . . . 14 ⊢ (𝐺:𝐴–1-1-onto→𝐴 → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = (𝐹 ∘ ( I ↾ 𝐴)))
28		f1of 6832	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹:𝐴⟶𝐴)
29		fcoi1 6764	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝐴⟶𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹)
30	28, 29	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → (𝐹 ∘ ( I ↾ 𝐴)) = 𝐹)
31	27, 30	sylan9eqr 2792	. . . . . . . . . . . . 13 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → (𝐹 ∘ (𝐺 ∘ ◡𝐺)) = 𝐹)
32	25, 31	eqtrid 2782	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((𝐹 ∘ 𝐺) ∘ ◡𝐺) = 𝐹)
33	32	difeq1d 4120	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → (((𝐹 ∘ 𝐺) ∘ ◡𝐺) ∖ I ) = (𝐹 ∖ I ))
34	33	dmeqd 5904	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → dom (((𝐹 ∘ 𝐺) ∘ ◡𝐺) ∖ I ) = dom (𝐹 ∖ I ))
35	34	adantr 479	. . . . . . . . 9 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (((𝐹 ∘ 𝐺) ∘ ◡𝐺) ∖ I ) = dom (𝐹 ∖ I ))
36		mvdco 19354	. . . . . . . . . 10 ⊢ dom (((𝐹 ∘ 𝐺) ∘ ◡𝐺) ∖ I ) ⊆ (dom ((𝐹 ∘ 𝐺) ∖ I ) ∪ dom (◡𝐺 ∖ I ))
37		simprr 769	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)
38		f1omvdcnv 19353	. . . . . . . . . . . . 13 ⊢ (𝐺:𝐴–1-1-onto→𝐴 → dom (◡𝐺 ∖ I ) = dom (𝐺 ∖ I ))
39	38	ad2antlr 723	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (◡𝐺 ∖ I ) = dom (𝐺 ∖ I ))
40		simprl 767	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (𝐺 ∖ I ) ⊆ 𝑋)
41	39, 40	eqsstrd 4019	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (◡𝐺 ∖ I ) ⊆ 𝑋)
42	37, 41	unssd 4185	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → (dom ((𝐹 ∘ 𝐺) ∖ I ) ∪ dom (◡𝐺 ∖ I )) ⊆ 𝑋)
43	36, 42	sstrid 3992	. . . . . . . . 9 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (((𝐹 ∘ 𝐺) ∘ ◡𝐺) ∖ I ) ⊆ 𝑋)
44	35, 43	eqsstrrd 4020	. . . . . . . 8 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ (dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)) → dom (𝐹 ∖ I ) ⊆ 𝑋)
45	44	expr 455	. . . . . . 7 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ dom (𝐺 ∖ I ) ⊆ 𝑋) → (dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋 → dom (𝐹 ∖ I ) ⊆ 𝑋))
46	45	con3d 152	. . . . . 6 ⊢ (((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) ∧ dom (𝐺 ∖ I ) ⊆ 𝑋) → (¬ dom (𝐹 ∖ I ) ⊆ 𝑋 → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
47	46	expimpd 452	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((dom (𝐺 ∖ I ) ⊆ 𝑋 ∧ ¬ dom (𝐹 ∖ I ) ⊆ 𝑋) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
48	47	ancomsd 464	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((¬ dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom (𝐺 ∖ I ) ⊆ 𝑋) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
49	24, 48	jaod 855	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → (((dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ ¬ dom (𝐺 ∖ I ) ⊆ 𝑋) ∨ (¬ dom (𝐹 ∖ I ) ⊆ 𝑋 ∧ dom (𝐺 ∖ I ) ⊆ 𝑋)) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
50	1, 49	biimtrid 241	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴) → ((dom (𝐹 ∖ I ) ⊆ 𝑋 ⊻ dom (𝐺 ∖ I ) ⊆ 𝑋) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋))
51	50	3impia 1115	1 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝐺:𝐴–1-1-onto→𝐴 ∧ (dom (𝐹 ∖ I ) ⊆ 𝑋 ⊻ dom (𝐺 ∖ I ) ⊆ 𝑋)) → ¬ dom ((𝐹 ∘ 𝐺) ∖ I ) ⊆ 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   ∨ wo 843   ∧ w3a 1085   ⊻ wxo 1507   = wceq 1539   ∖ cdif 3944   ∪ cun 3945   ⊆ wss 3947   I cid 5572  ^◡ccnv 5674  dom cdm 5675   ↾ cres 5677   ∘ ccom 5679  ⟶wf 6538  –1-1-onto→wf1o 6541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-xor 1508  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550

This theorem is referenced by:  f1omvdco3  19358